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 <cstdlib>
#include <cassert>
#include <utility>
#include <tuple>

#include <cstdio>
#include <vector>
#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,n) loop(i,0,n)

using namespace std;

#define np nullptr
struct Node {
    int val;
    Node * ch[2];
    int pri, cnt, sum;
    int min;
    Node(int v, int p) : val(v), pri(p), cnt(1), sum(v), min(v) {
        ch[0] = ch[1] = np;
    }
};

void destory(Node * t){
    if(t == np) return;
    destory(t->ch[0]);
    destory(t->ch[1]);
    delete t;
}

int count(Node * t){
    return t == np ? 0 : t->cnt;
}
int sum(Node * t){
    return t == np ? 0 : t->sum;
}

int const inf = 1e9;

int min(Node * t){
    return t == np ? inf : t->min;
}

int min(int x, int y, int z){
    return min(x,min(y,z));
}

void show(Node * n, int ofs=0){
    if(n==nullptr) return;
    show(n->ch[0],ofs+1);
    rep(i,ofs*2) putchar(' ');
    printf("v:%d m:%d (%p)\n",n->val,n->min,n);
    show(n->ch[1],ofs+1);
}

void update(Node * t){
    t->cnt = count(t->ch[0]) + count(t->ch[1]) + 1;
    t->sum = sum(t->ch[0]) + sum(t->ch[1]) + t->val;
    t->min = min( min(t->ch[0]), min(t->ch[1]), t->val );
}

Node * merge(Node * l, Node * r){
    if(l == np || r == np) return l == np ? r : l;
    if(l->pri > r->pri){
        l->ch[1] = merge(l->ch[1],r);
        update(l);
        return l;
    } else {
        r->ch[0] = merge(l,r->ch[0]);
        update(r);
        return r;
    }
}

pair<Node*,Node*> split(Node * t, int k){
    if(t == np) return make_pair(np,np);
    if(k <= count(t->ch[0])){
        auto s = split(t->ch[0],k);
        t->ch[0] = s.second;
        update(t);
        return make_pair(s.first, t);
    } else {
        k -= count(t->ch[0]) + 1;
        auto s = split(t->ch[1],k);
        t->ch[1] = s.first;
        update(t);
        return make_pair(t,s.second);
    }
}

Node * erase(Node * t, int k){
    Node *l,*m,*r;
    tie(l,m) = split(t,k);
    tie(m,r) = split(m,1);
    destory(m);
    return merge(l,r);
}

Node * at(Node * t, int k){
    int lc = count(t->ch[0]);
    if(k < lc) return at(t->ch[0],k);
    else if(k == lc) return t;
    else return at(t->ch[1], k-lc-1);
}

Node * insert(Node * t, int k, int v){
    Node *l,*m = new Node(v,rand()), *r;
    tie(l,r) = split(t,k);
    return merge(merge(l,m),r);
}

int min(Node * t, int l, int r){
    if(r - l <= 0) return inf;
    if(r - l == count(t)) return min(t);
    int s = count(t->ch[0]);
    if(l == s && r - s == 1) return t->val;
    int res = inf;
    if(l < s) res = min(res, min(t->ch[0], l, min(s,r)));
    if(l <= s && s < r) res = min(res, min(t, s, s+1));
    if(s+1 < r) res = min(res, min(t->ch[1], max(0,l-s-1), r-s-1));
    return res;
}

int get(){
    int x;
    scanf("%d",&x);
    return x;
}
void put(int x){
    //printf("ans : %d\n",x);
    printf("%d\n",x);
}

#define eputs(s) fprintf(stderr,s "\n")

int main(){
#ifdef DEBUG
    freopen("in","r",stdin);
#endif
    srand(time(0));
    int n = get(), q = get();
    Node * root = np;
    rep(i,n){
        root = insert(root,i,get());
    }
    //show(root);
    //puts("---");

    rep(i,q){
        int op = get();
        if(false){
        } else if(op == 0){
            int l = get(), r = get();
            //printf("shift %d %d\n",l,r);
            int x = at(root,r)->val;
            root = erase(root,r);
            root = insert(root,l,x);
        } else if(op == 1){
            int l = get(), r = get();
            r++;
            //printf("min[%d,%d)\n",l,r);
            put(min(root,l,r));
        } else if(op == 2){
            int p = get(), v = get();// /10000;
            //printf("change %d %d\n",p,v);
            root = erase(root,p);
            root = insert(root,p,v);
        }
        // show(root);
        // puts("---");
    }
}