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;

#define for_(i,a,b) for(int i=(a);i<(b);++i)

const int iINF = 1L << 30;

template< typename T >
class Treap {
private:
	unsigned int rnd() {
		static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
		unsigned int t = (x ^ (x << 11));
		x = y; y = z; z = w;
		return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
	}
	
	struct Node {
		T val, data;
		Node *lch, *rch;
		int pri, cnt;
		
		Node(T v, int p) : val(v), data(v), pri(p), cnt(1) { lch = rch = nullptr; }
	};
	
	int count(Node* t) { return t ? t->cnt : 0; }
	T data(Node* t) { return t ? t->data : T(iINF); }
	
	Node *root;
	
	Node* update(Node *t) {
		if (!t) return t;
		t->cnt = count(t->lch) + count(t->rch) + 1;
		t->data = min(min(data(t->lch), data(t->rch)), t->val);
		return t;
	}
	
	Node* merge(Node* l, Node* r) {
		if (!l || !r) return l ? l : r;
	
		if (l->pri > r->pri) {
			l->rch = merge(l->rch, r);
			return update(l);
		} else {
			r->lch = merge(l, r->lch);
			return update(r);
		}
	}
	
	typedef pair< Node*, Node* > pnn;
	
	pnn split(Node* t, int k) {
		if (!t) return pnn(nullptr, nullptr);
		
		if (k <= count(t->lch)) {
			pnn s = split(t->lch, k);
			t->lch = s.second;
			return pnn(s.first, update(t));
		} else {
			pnn s = split(t->rch, k - count(t->lch) - 1);
			t->rch = s.first;
			return pnn(update(t), s.second);
		}
	}
	
	Node* insert(Node* t, int k, T val, int pri) {
		pnn s = split(t, k);
		t = merge(s.first, new Node(val, pri));
		t = merge(t, s.second);
		return update(t);
	}
	
	Node* erase(Node* t, int k) {
		pnn s1 = split(t, k + 1);
		pnn s2 = split(s1.first, k);
		t = merge(s2.first, s1.second);
		delete s2.second;
		return update(t);
	}
	
	Node* find(Node* t, int k) {
		int c = count(t->lch);
		if (k < c) return find(t->lch, k);
		if (k > c) return find(t->rch, k - c - 1);
		return t;
	}
	
	void dump(Node* t) {
		if (!t) return;
		cout << "(";
		dump(t->lch);
		cout << t->val;
		dump(t->rch);
		cout << ")";
	}
	
public:
	Treap() : root(nullptr) {}
	
	void insert(int k, T val) { root = insert(root, k, val, rnd()); }
	void erase(int k) { root = erase(root, k); }
	Node* find(int k) { return find(root, k); }
	int size() { return count(root); }
	
	void dump() {
		dump(root);
		cout << endl;
	}
	
	~Treap() { while (root) erase(0); }
	
	void shift(int l, int r) {
		pnn a, b, c;
		a = split(root, r);
		b = split(a.first, r - 1);
		c = split(b.first, l);
		root = merge(c.first, b.second);
		root = merge(root, c.second);
		root = merge(root, a.second);
	}
	
	T query(int l, int r, Node* t) {
		int c = count(t);
		
		if (l >= c || r <= 0) return T(iINF);
		if (l <= 0 && r >= c) return data(t);
		
		c = count(t->lch);
		int res = min(query(l, r, t->lch), query(l - c - 1, r - c - 1, t->rch));
		if (l <= c && c < r) res = min(res, t->val);
		return res;
	}
	
	T query(int l, int r) { return query(l, r, root); }
};

int main() {
	int n, q;
	cin >> n >> q;
	
	Treap< int > treap;
	
	for_(i,0,n) {
		int a;
		scanf("%d", &a);
		treap.insert(i, a);
	}
	
	for_(i,0,q) {
		int x, y, z;
		scanf("%d %d %d", &x, &y, &z);
		
		if (x == 0) treap.shift(y, z + 1);
		
		if (x == 1) printf("%d\n", treap.query(y, z + 1));
		
		if (x == 2) {
			treap.erase(y);
			treap.insert(y, z);
		}
	}
	
	return 0;
}