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<algorithm>
#include<map>
using namespace std;
#define INF (1 << 30)

struct Spray{
    Spray(int v){
	val = v;
	minimum = v;
	size = 1;
	l = r = p = 0;
    }
    int val, minimum, size;
    Spray *l, *r, *p;
    
    int state(){
	if(p == 0)return 0;
	if(p->l == this)return -1;
	if(p->r == this)return 1;
    }

    Spray *update(){
	size = (l?l->size:0) + (r?r->size:0) + 1;
	minimum = min(val, min((l?l->minimum:INF), (r?r->minimum:INF)));
	return this;
    }

    void rotate(){
	Spray *par = p, *mid;
	if(par->l == this){
	    mid = r;r = par;
	    par->l = mid;
	}
	if(par->r == this){
	    mid = l;l = par;
	    par->r = mid;
	}
	if(mid)mid->p = par;
	p = par->p; par->p = this;
	if(p && p->l == par)p->l = this;
	if(p && p->r == par)p->r = this;
	par->update();
	update();
    }
    
    void spray(){
	while(state()){
	    int st = state() * p->state();
	    if(st == -1)rotate();
	    if(st == 1)p->rotate();
	    rotate();
	}
    }
};

typedef pair<Spray*, Spray*> SprayP;
typedef SprayP P;

Spray* node(Spray *r, int pos){
    int lsize = (r->l)?r->l->size:0;
    int rsize = (r->r)?r->r->size:0;
    if(lsize == pos - 1)return r;
    if(lsize >  pos - 1)return node(r->l, pos);
    if(lsize <  pos - 1)return node(r->r, pos - lsize - 1);
}

SprayP split(Spray* r, int pos){
    if(pos == 0)return P(0, r);
    if(r->size == pos) return P(r, 0);
    r = node(r, pos);
    r->spray();
    Spray *right = r->r;
    r->r = 0; right->p = 0;
    return P(r->update(), right->update());
}

Spray *merge(Spray *a, Spray *b){
    if(a == 0)return b;
    if(b == 0)return a;
    a = node(a, a->size);
    a->spray();b->spray();
    a->r = b; b->p = a;
    a->update();
    return a->update();
}

SprayP delt(Spray *r, int pos){
    SprayP tmp1 = split(r, pos);
    SprayP tmp2 = split(tmp1.second, 1);
    return P(merge(tmp1.first, tmp2.second), tmp2.first);
}

Spray *insert(Spray *r, Spray *it, int pos){
    SprayP tmp = split(r, pos);
    return merge(merge(tmp.first, it), tmp.second);
}

Spray *shift(Spray *r, int left, int right){
    SprayP tmp = delt(r, right);
    return insert(tmp.first, tmp.second, left);
}

Spray *setnum(Spray *r, int pos, int val){
    r = node(r, pos + 1);
    r->spray();
    r->val = val;
    return r->update();
}

Spray *comb(Spray *r, Spray *l){
    l->l = r;
    if(r) r->p = l;
    return l->update();
}

int main(){
    int n, q, a, x, y, z;
    cin >> n >> q;
    Spray *r = 0;
    for(int i = 0;i < n;i++){
	cin >> a;
	r = comb(r, new Spray(a));
    }
    for(int i = 0;i < q;i++){
	cin >> x >> y >> z;
	if(x == 0){
	    r = shift(r, y, z);
	}
	if(x == 1){
	    SprayP tmp1 = split(r, z + 1);
	    SprayP tmp2 = split(tmp1.first, y);
	    cout << tmp2.second->minimum << endl;
	    tmp1.first = merge(tmp2.first, tmp2.second);
	    r = merge(tmp1.first, tmp1.second);
	}
	if(x == 2){
	    r = setnum(r, y, z);
	}
    }
    return 0;
}