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 <stdio.h>
#include <algorithm>
#include <map>

using namespace std;

#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
	
struct Node{
	Node *l,*r,*p;
	int s,v,m;
	Node():l(NULL),r(NULL),p(NULL){}
	static int Size(Node* x){
		return x?x->s:0;
	}
	static int Mini(Node* x){
		return x?x->m:1145141919;
	}
	Node* Update(){
		s=1+Size(l)+Size(r);
		m=min({v,Mini(l),Mini(r)});
		return this;
	}
	int Pos(){
		if(p&&p->l==this) return -1;
		if(p&&p->r==this) return 1;
		return 0;
	}
	void Rotate(){
		Node *q=p,*c;
		if(Pos()==1){
			c=l;
			l=p;
			p->r=c;
		}else{
			c=r;
			r=p;
			p->l=c;
		}
		if(c) c->p=p;
		p=p->p;
		q->p=this;
		if(p&&p->l==q) p->l=this;
		if(p&&p->r==q) p->r=this;
		q->Update();
	}
	Node* Splay(){
		while(p){
			int a=Pos(),b=p->Pos();
			if(b&&a==b) p->Rotate();
			if(b&&a!=b) Rotate();
			Rotate();
		}
		return Update();
	}
	Node* Idx(int i){
		if(i<Size(l)) return l->Idx(i);
		else if(i>Size(l)) return r->Idx(i-Size(l)-1);
		return Splay();
	}
} d[200000];

pair<Node*,Node*> Split(Node* x,int i){
	if(i<0) return MP((Node*)NULL,x);
	x=x->Idx(i);
	Node* c=x->r;
	if(c) c->p=NULL;
	x->r=NULL;
	return MP(x->Update(),c);
}

Node* Merge(Node* a,Node* b){
	if(!a||!b) return a?a:b;
	while(a->r) a=a->r;
	b->p=a->Splay();
	a->r=b;
	return a->Update();
}

int main(){
	int n,q;
	scanf("%d%d",&n,&q);
	Node* w=NULL;
	REP(i,n){
		scanf("%d",&d[i].v);
		w=Merge(w,d[i].Update());
	}
	REP(_,q){
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		if(x==0){
			auto r=Split(w,z);
			auto q=Split(r.first,z-1);
			auto p=Split(q.first,y-1);
			w=Merge(Merge(p.first,q.second),Merge(p.second,r.second));
		}else if(x==1){
			auto q=Split(w,z);
			auto p=Split(q.first,y-1);
			printf("%d\n",p.second->m);
			w=Merge(Merge(p.first,p.second),q.second);
		}else{
			w=w->Idx(y);
			w->v=z;
			w->Update();
		}
	}
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
  int n,q;
  cin >> n >> q;
  vector<int> v(n);
  for(int i=0; i<n; i++){
    cin >> v[i];
  }
  for(int i=0; i<q; i++){
    int x,y,z,t;
    cin >> x >> y >> z;
    switch(x){
    case 0:
      t = v[z];
      for(int j=z; j>y; j--){
        v[j] = v[j-1];
      }
      v[y] = t;
      break;
    case 1:
      t = v[y];
      for(int j=y; j<=z; j++){
        t = min(t,v[j]);
      }
      cout << t << endl;
      break;
    case 2:
      v[y] = z;
      break;
    }
  }
  return 0;
}