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 <iostream>
#include <cstdlib>
#include <ctime>

using namespace std;

const int INF = 1<<29;

struct RBST_node{
	int val,mv,size;
	RBST_node *l_child,*r_child;
	
	RBST_node(int v){
		val=mv=v;
		size=1;
		l_child=r_child=NULL;
		srand(time(NULL));
	}
};
typedef pair<RBST_node*, RBST_node*> P;

RBST_node* update(RBST_node* x){
	x->size = 1;
	x->mv = x->val;
	if(x->l_child){
		x->size += x->l_child->size;
		x->mv = min(x->mv,x->l_child->mv);
	}
	if(x->r_child){
		x->size += x->r_child->size;
		x->mv = min(x->mv,x->r_child->mv);
	}
	return x;
}

RBST_node* merge(RBST_node* x, RBST_node* y){
	if(!x) return y;
	if(!y) return x;
	
	int m=x->size, n=y->size;
	if(rand() % (m+n) < m){
		x->r_child = merge(x->r_child,y);
		return update(x);
	}else{
		y->l_child = merge(x,y->l_child);
		return update(y);		
	}
}

int node_size(RBST_node* x){
	if(!x) return 0;
	else return x->size;
}

//[,pos) [pos,)????????¢????????????
P split(RBST_node* x,int pos){
	if(!x) return P(NULL,NULL);
	if(node_size(x->l_child)<pos){
		P tmp = split(x->r_child,pos-node_size(x->l_child)-1);
		x->r_child = tmp.first;
		return P(update(x),tmp.second);
	}else{
		P tmp = split(x->l_child,pos);
		x->l_child = tmp.second;
		return P(tmp.first,update(x));
	}
}

RBST_node* insert(RBST_node* x,int val,int pos){
	RBST_node *p = new RBST_node(val);
	P tmp = split(x,pos);
	RBST_node *l = merge(tmp.first,p),*r=tmp.second;
	return merge(l,r); 
}

RBST_node* erase(RBST_node *x,int pos){
	P tmp = split(x,pos);
	RBST_node *l =tmp.first;
	RBST_node *r = split(tmp.second,1).second;
	return merge(l,r);
}

int main(){
	
	RBST_node *t=NULL;
	
	int n,q;
	cin>>n>>q;
	
	for(int i=0;i<n;i++){
		int a;
		scanf("%d",&a);
		t=insert(t,a,i);
	}
		
	for(int i=0;i<q;i++){
		int x,y,z;
		cin>>x>>y>>z;
		
		if(x==0){
			P p1=split(t,z);
			P p2=split(p1.first,y);
			P p3=split(p1.second,1);
			RBST_node *u=merge(p2.first,p3.first);
			RBST_node *v=merge(p2.second,p3.second);
			t=merge(u,v);
		}else if(x==1){
			P p1=split(t,y);
			P p2=split(p1.second,z-y+1);
			cout<<p2.first->mv<<endl;
			t=merge(p1.first,merge(p2.first,p2.second));
		}else{
			t=erase(t,y);
			t=insert(t,z,y);
		}
	}
	
	return 0;
}