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>
using namespace std;

struct RMQ {
	using type = int;
	static type id() { return INT_MAX; }
	static type op(type l, type r) { return min(l, r); }
};

template <typename M>
class avl_tree {
	using T = typename M::type;
	struct node {
		T val, all;
		node *ch[2];
		int dep, size;
		node(T v, node* l = nullptr, node* r = nullptr)
			: val(v), all(v), ch{ l, r }, dep(1), size(1) {}
	};
	int depth(node *t) const { return t ? t->dep : 0; }
	int count(node *t) const { return t ? t->size : 0; }
	T que(node *t) const { return t ? t->all : M::id(); }
	node *update(node *t) {
		t->dep = max(depth(t->ch[0]), depth(t->ch[1])) + 1;
		t->size = count(t->ch[0]) + 1 + count(t->ch[1]);
		t->all = M::op(que(t->ch[0]), M::op(t->val, que(t->ch[1])));
		return t;
	}
	node *rotate(node *t, int b) {
		node *s = t->ch[1 - b];
		t->ch[1 - b] = s->ch[b];
		s->ch[b] = t;
		update(t);
		return update(s);
	}
	node *fix(node *t) {
		if (!t) return t;
		int d = depth(t->ch[0]) - depth(t->ch[1]), b = (d < 0);
		if (abs(d) != 2) return t;
		if (depth(t->ch[b]->ch[1 - b]) > depth(t->ch[b]->ch[b])) {
			t->ch[b] = rotate(t->ch[b], b);
		}
		return rotate(t, 1 - b);
	}
	node *insert(node *t, int k, T v) {
		if (!t) return new node(v);
		int c = count(t->ch[0]), b = (k > c);
		t->ch[b] = insert(t->ch[b], k - (b ? (c + 1) : 0), v);
		return fix(update(t));
	}
	node *erase(node *t) {
		if (!t) return t;
		if (!t->ch[0] && !t->ch[1]) return nullptr;
		if (!t->ch[0] || !t->ch[1]) return t->ch[t->ch[0] == nullptr];
		return fix(update(new node(find(t->ch[1], 0)->val, t->ch[0], erase(t->ch[1], 0))));
	}
	node *erase(node *t, int k) {
		if (!t) return t;
		int c = count(t->ch[0]);
		if (k == c) return fix(erase(t));
		int b = (k > c);
		t->ch[b] = erase(t->ch[b], k - (b ? c + 1 : 0));
		return fix(update(t));
	}
	node *find(node *t, int k) const {
		if (!t) return t;
		int c = count(t->ch[0]);
		return k < c ? find(t->ch[0], k) : k == c ? t : find(t->ch[1], k - (c + 1));
	}
	T find(node *t, int l, int r) const {
		if (!t || r <= 0 || t->size <= l) return M::id();
		if (l <= 0 && t->size <= r) return t->all;
		int c = count(t->ch[0]);
		return M::op(find(t->ch[0], l, r), M::op((l <= c && c < r ? t->val : M::id()), find(t->ch[1], l - (c + 1), r - (c + 1))));
	}
	node *root;
public:

	avl_tree() : root(nullptr) {}
	int size() const {
		return count(root);
	}
	void insert(int k, T b) {
		root = insert(root, k, b);
	}
	void erase(int k) {
		root = erase(root, k);
	}
	T find(int k) const {
		return find(root, k)->val;
	}
	T find(int l, int r) const {
		return find(root, l, r);
	}
};

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	int n, q;
	cin >> n >> q;
	avl_tree<RMQ> tree;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		tree.insert(i, a);
	}
	while (q--) {
		int x, y, z;
		cin >> x >> y >> z;
		if (x == 0) {
			int val = tree.find(z);
			tree.erase(z);
			tree.insert(y, val);
		}
		else if (x == 1) {
			printf("%d\n", tree.find(y, z + 1));
		}
		else {
			tree.erase(y);
			tree.insert(y, z);
		}
	}
	return 0;
}