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;

const int INF=1001001001;

struct RBST{
    struct node{
        int val,cnt,mi;
        node *left,*right;
        node(int val):val(val),cnt(1),mi(val){
            left=right=NULL;
        }
    };

    RBST():root(NULL){srand((unsigned)time(NULL));}

    inline int cnt(node *t){return t?t->cnt:0;}
    inline int mi(node *t){return t?t->mi:INF;}

    node *update(node *t){
        if(t==NULL)return NULL;
        t->cnt=cnt(t->left)+cnt(t->right)+1;
        t->mi=min(min(mi(t->left),mi(t->right)),t->val);
        return t;
    }

    node *root;

    node *merge(node *l,node *r){
        if(!l||!r)return l?l:r;
        int tmp=cnt(l)+cnt(r);
        if(rand()%tmp<cnt(l)){
            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){//[0,k) [k,n)
        if(!t)return make_pair((node *)NULL,(node *)NULL);
        if(k<=cnt(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-cnt(t->left)-1);
            t->right=s.first;
            return make_pair(update(t),s.second);
        }
    }

    node  *insert(node *t,int k,int val){
        pair<node *,node *>s=split(t,k);
        t=merge(s.first,new node(val));
        t=merge(t,s.second);
        return t;
    }

    node *erase(node *t,int k){
        pair<node *,node *>s1,s2;
        s1=split(t,k-1);
        s2=split(s1.second,1);
        return merge(s1.first,s2.second);
    }

    int getMin(node *t,int l,int r){
        if(r<=0||cnt(t)<=l)return INF;
        if(l<=0&&cnt(t)<=r)return mi(t);

        int vl=getMin(t->left,l,r);
        int vr=getMin(t->right,l-cnt(t->left)-1,r-cnt(t->left)-1);
        int res=min(vl,vr);
        if(l<=cnt(t->left)&&cnt(t->left)<r)res=min(res,t->val);
        return res;
    }

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

    void quary0(int l,int r){
        pair<node *,node *>s1,s2,s3;
        s1=split(root,l);//[0,l),[l,n)
        s2=split(s1.second,r-l-1);
        s3=split(s2.second,1);

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

    int quary1(int l,int r){
        return getMin(root,l,r);
    }

    void quary2(int k,int x){
        erase(k);
        insert(k,x);
    }

    void debug(node *t){
        if(!t)return;
        debug(t->left);
        printf("%d ",t->val);
        debug(t->right);
    }
    void debug(){debug(root);puts("");}
};

RBST T;
int N,Q;
int main(){
    scanf("%d%d",&N,&Q);
    for(int i=0;i<N;i++){
        int a;scanf("%d",&a);T.insert(i,a);
    }

    while(Q--){
        int type;scanf("%d",&type);
        if(type==0){
            int l,r;scanf("%d%d",&l,&r);
            T.quary0(l,r+1);
        }
        else if(type==1){
            int l,r;scanf("%d%d",&l,&r);
            printf("%d\n",T.quary1(l,r+1));
        }
        else{
            int k,x;scanf("%d%d",&k,&x);
            T.quary2(k,x);
        }
        //T.debug();
    }
    return 0;
}