Go: package main

// packed from [splaytree.go main.rmq.go splaytree_debug.go] with goone.

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
	"strings"
)

type SplayTreeNode struct {
	parent, left, right *SplayTreeNode

	size    int
	value   int
	minimum int
}

func newSplayTreeNode(v int) *SplayTreeNode {
	return &SplayTreeNode{value: v}
}

func (node *SplayTreeNode) rotate() {
	var pp, p, c *SplayTreeNode
	p = node.parent
	pp = p.parent
	if pp != nil && pp.left == p {
		pp.left = node
	}
	if pp != nil && pp.right == p {
		pp.right = node
	}
	node.parent = pp
	if p.left == node {
		c = node.right
		node.right = p
		p.left = c
	} else {
		c = node.left
		node.left = p
		p.right = c
	}
	p.parent = node
	if c != nil {
		c.parent = p
	}
	p.update()
	node.update()
}

func (node *SplayTreeNode) state() int {
	if node.parent == nil {
		return 0
	}
	if node.parent.left == node {
		return -1
	} else if node.parent.right == node {
		return 1
	}
	return 0
}

func (node *SplayTreeNode) splay() {
	for node.state() != 0 {
		if node.parent.state() == 0 {
			node.rotate()
			return
		}
		if node.state() == node.parent.state() {
			node.parent.rotate()
			node.rotate()
		} else {
			node.rotate()
			node.rotate()
		}
	}
}

func (node *SplayTreeNode) update() {
	node.size = 1
	node.minimum = node.value
	if node.left != nil {
		node.size += node.left.size
		node.minimum = min(node.minimum, node.left.minimum)
	}
	if node.right != nil {
		node.size += node.right.size
		node.minimum = min(node.minimum, node.right.minimum)
	}
}
func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func (node *SplayTreeNode) Get(idx int) *SplayTreeNode {
	cur := node
	for true {
		lSize := 0
		if cur.left != nil {
			lSize = cur.left.size
		}
		if idx < lSize {
			cur = cur.left
		}
		if lSize == idx {
			cur.splay()
			return cur
		}
		if idx > lSize {
			cur = cur.right
			idx = idx - lSize - 1
		}
	}
	return nil
}

func mergeSplayNode(l, r *SplayTreeNode) (root *SplayTreeNode) {
	if l == nil {
		return r
	}
	if r == nil {
		return l
	}
	root = l.Get(l.size - 1)
	root.right = r
	r.parent = root
	root.update()
	return root
}

func (node *SplayTreeNode) Split(leftCount int) (left *SplayTreeNode, right *SplayTreeNode) {
	root := node.Get(leftCount)
	lRoot, rRoot := root.left, root

	rRoot.left = nil
	if lRoot != nil {
		lRoot.parent = nil
	}
	rRoot.update()
	return lRoot, rRoot
}

func splayTreeInsert(t *SplayTreeNode, idx int, node *SplayTreeNode) (root *SplayTreeNode) {
	l, r := t.Split(idx)
	return mergeSplayNode(
		mergeSplayNode(l, node),
		r,
	)
}

func removeSplayTree(t *SplayTreeNode, idx int) (root *SplayTreeNode, removed *SplayTreeNode) {
	target := t.Get(idx)
	l, r := target.left, target.right
	if l != nil {
		l.parent = nil
	}
	if r != nil {
		r.parent = nil
	}
	target.left = nil
	target.right = nil
	target.update()
	return mergeSplayNode(l, r), target
}

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords)
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	n := scanInt(sc)
	q := scanInt(sc)
	table := newDebugNodeSlice(200001)
	for i := 0; i < n; i++ {
		table.l[i].parent = &table.l[i+1]
		table.l[i+1].left = &table.l[i]
		table.l[i].update()
		table.l[i+1].update()
	}
	var root *SplayTreeNode = &table.l[n]
	for i := 0; i < n; i++ {
		table.l[i].value = scanInt(sc)
		table.l[i].update()
	}
	table.l[n].update()
	for i := 0; i < q; i++ {
		switch scanInt(sc) {
		case 0:
			root = shift(root, scanInt(sc), scanInt(sc))
		case 1:
			l := scanInt(sc)
			r := scanInt(sc)
			tmp, rRoot := root.Split(r + 1)
			lRoot, cRoot := tmp.Split(l)
			fmt.Println(cRoot.minimum)
			root = mergeSplayNode(mergeSplayNode(lRoot, cRoot), rRoot)
		case 2:
			root = root.Get(scanInt(sc))
			root.value = scanInt(sc)
			root.update()
		}
	}
}


C++: #include <bits/stdc++.h>

template <typename T>
class treap {
    struct node {
        T val;
        node* l_child, *r_child;
        int priority;
        unsigned int sz;
        T sum;
        T mini;

        node(T v, double p)
            : val(v), priority(p), sz(1), sum(v), mini(v)
        {
            l_child = r_child = nullptr;
        }
        ~node() {
            delete l_child;
            delete r_child;
        }
    };

    unsigned int size(node* t) const {
        return !t ? 0 : t->sz;
    }

    T sum(node* t) {
        return !t ? 0 : t->sum;
    }

    T min(node* t) {
        return !t ? std::numeric_limits<T>::max() : t->mini; 
    }

    node* update(node* t) {
        t->sz = size(t->l_child) + size(t->r_child) + 1;
        t->sum = sum(t->l_child) + sum(t->r_child) + t->val;
        t->mini = std::min(std::min(min(t->l_child), min(t->r_child)), t->val);
        return t;
    }

    node* merge(node* l, node* r) {
        if(!l || !r) {
            return !l ? r : l;
        }

        if(l->priority > r->priority) {
            l->r_child = merge(l->r_child, r);
            return update(l);
        } else {
            r->l_child = merge(l, r->l_child);
            return update(r);
        }
    }

    // [0, k), [k, n)
    std::pair<node*, node*> split(node* t, unsigned int k) {
        if(!t) {
            return std::make_pair(nullptr, nullptr);
        }

        if(k <= size(t->l_child)) {
            auto s = split(t->l_child, k);
            t->l_child = s.second;
            return std::make_pair(s.first, update(t));
        } else {
            auto s = split(t->r_child, k - size(t->l_child) - 1);
            t->r_child = s.first;
            return std::make_pair(update(t), s.second);
        }
    }

    node* insert(node* t, int k, T v, int p) {
        auto s = split(t, k);
        t = merge(s.first, new node(v, p));
        t = merge(t, s.second);
        return update(t);
    }

    node* erase(node* t, unsigned int k) {
        auto u = split(t, k + 1);
        auto v = split(u.first, k);
        t = merge(v.first, u.second);
        delete v.second;
        return update(t);
    }

    T range_minimum_query(int l, int r, node* t) {
        int sz = size(t);
        if(r <= 0 || sz <= l) {
            return std::numeric_limits<T>::max();
        }
        if(l <= 0 && sz <= r) {
            return min(t);
        }

        sz = size(t->l_child);
        T vl = range_minimum_query(l, r, t->l_child);
        T vr = range_minimum_query(l - sz - 1, r - sz - 1, t->r_child);
        T res = std::min(vl, vr);
        if(l <= sz && sz < r) {
            res = std::min(res, t->val);
        }
        return res;
    }

    T sum(int l, int r, node* t) {
        int sz = size(t);
        if(r <= 0 || sz <= l) {
            return 0;
        }
        if(l <= 0 && sz <= r) {
            return sum(t);
        }

        sz = size(t->l_child);
        T vl = sum(l, r, t->l_child);
        T vr = sum(l - sz - 1, r - sz - 1, t->r_child);
        T res = vl + vr;
        if(l <= sz && sz < r) {
            res += t->val;
        }
        return res;
    }


    // member variable
    node* root;

public:
    treap()
        : root(nullptr)
    {
        std::srand(time(nullptr));
    }
    treap(int n, T val) {
        for(int i = 0; i < n; ++i) {
            insert(i, val);
        }
    }
    ~treap() {
        delete root;
    }


    unsigned int size() const {
        return size(root);
    }

    void insert(unsigned int k, T val) {
        root = insert(root, k, val, std::rand());
    }

    void erase(int k) {
        root = erase(root, k);
    }

    void update(int k, T v) {
        erase(k);
        insert(k, v);
    }

    node* find(unsigned int k) {
        node* res = root;
        while(res) {
            unsigned int s = size(res->l_child);
            if(s > k) {
                res = res->l_child;
            } else if(s == k) {
                return res;
            } else {
                res = res->r_child;
                k -= s + 1;
            }
        }
        return res;
    }

    // [l, r)
    T range_minimum_query(int l, int r) {
        return range_minimum_query(l, r, root);
    }

    void shift(int l, int r) {
        auto s1 = split(root, l);             // [0, l), [l, ...)
        auto s2 = split(s1.second, r - l);    // [l, r), [r, ...)
        auto s3 = split(s2.first, r - l - 1); // [l, r - 1), r - 1

        root = merge(s1.first, s3.second);
        root = merge(root, s3.first);
        root = merge(root, s2.second);
    }

    T sum(int l, int r) {
        return sum(l, r, root);
    }
};

using namespace std;

int main() {
    int n, q;
    cin >> n >> q;
    treap<int> t;
    for(int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        t.insert(i, a);
    }

    while(q--) {
        int x, y, z;
        cin >> x >> y >> z;
        if(x == 0) {
            t.shift(y, z + 1);
        } else if(x == 1) {
            cout << t.range_minimum_query(y, z + 1) << endl;
        } else {
            t.update(y, z);
        }
    }
}