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 <random>
#include <utility>
using namespace std;
template<typename T> class RBST {
public:
	struct node {
		T value;
		T min_val;
		int cnt;
		node *left,*right;
		node(T v):value(v),min_val(v),cnt(1) {
			left=right=NULL;
		}
	};
	random_device rnd;
	mt19937 mt;
	node *root;
	RBST():root(NULL) {mt.seed(rnd());}
	int count(node *t) {return !t?0:t->cnt;}
	node *update(node *t) {
		if(!t) return NULL;
		t->cnt=count(t->left)+count(t->right)+1;
		t->min_val=t->value;
		if(t->left) t->min_val=min(t->min_val,t->left->min_val);
		if(t->right) t->min_val=min(t->min_val,t->right->min_val);
		return t;
	}
	node *merge(node *l,node *r) {
		if(!l||!r) return !l?r:l;
		uniform_real_distribution<> x(0,l->cnt+r->cnt);
		if(x(mt)<l->cnt) {
			l->right=merge(l->right,r);
			return update(l);
		}else {
			r->left=merge(l,r->left);
			return update(r);
		}
	}
	pair<node*,node*> split(node *t,int k) {
		if(!t) return pair<node*,node*>(NULL,NULL);
		if(k<=count(t->left)) {
			pair<node*,node*> s=split(t->left,k);
			t->left=s.second;
			return make_pair(s.first,update(t));
		}else {
			pair<node*,node*> s=split(t->right,k-count(t->left)-1);
			t->right=s.first;
			return make_pair(update(t),s.second);
		}
	}
	node *insert(node *t,int k,T v) {
		pair<node*,node*> s=split(t,k);
		node *u=new node(v);
		t=merge(s.first,u);
		t=merge(t,s.second);
		return update(t);
	}
	void insert(int k,T v) {
		root=insert(root,k,v);
	}
	int lower_bound(node *t,T v) {
		if(!t) return 0;
		int c=count(t->left);
		if(t->value>v) {
			return lower_bound(t->left,v);
		}else if(t->value==v) {
			return c;
		}else {
			return c+1+lower_bound(t->right,v);
		}
	}
	int lower_bound(T v) {
		return lower_bound(root,v);
	}
	T get(node *t,int k) {
		int c=count(t->left);
		if(c==k) {
			return t->value;
		}else if(c>k) {
			return get(t->left,k);
		}else {
			return get(t->right,k-c-1);
		}
	}
	T get(int k) {
		return get(root,k);
	}
	node *erase(node *t,int k) {
		pair<node*,node*> u,v;
		u=split(t,k+1);
		v=split(u.first,k);
		t=merge(v.first,u.second);
		return update(t);
	}
	void erase(int k) {
		root=erase(root,k);
	}
};
int main() {
	RBST<int> r;
	int n,q;
	scanf("%d %d",&n,&q);
	for(int i=0;i<n;i++) {
		int a;
		scanf("%d",&a);
		r.insert(i,a);
	}
	for(int i=0;i<q;i++) {
		int x,y,z;
		scanf("%d %d %d",&x,&y,&z);
		if(x==0) {
			pair<RBST<int>::node*,RBST<int>::node*> a,b,c;
			a=r.split(r.root,z+1);//[0,z+1)[z+1,n)
			b=r.split(a.first,z);//[0,z)[z,z+1)
			c=r.split(b.first,y);//[0,y)[y,z)
			r.root=r.merge(c.first,r.merge(b.second,r.merge(c.second,a.second)));
		}else if(x==1) {
			pair<RBST<int>::node*,RBST<int>::node*> a,b,c;
			a=r.split(r.root,z+1);
			b=r.split(a.first,y);
			printf("%d\n",b.second->min_val);
			r.root=r.merge(b.first,r.merge(b.second,a.second));
		}else {
			r.erase(y);
			r.insert(y,z);
		}
	}
}