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;
struct Tree{
	Tree(int v){
		size = 1;
		min = val = v;
		l = r = 0;
		index = 0;	
	}
	Tree(){};
	int val, size, min, index;
	Tree *l, *r;
};

#define INF (1<<30)
typedef pair<Tree*, Tree*> PTree;
Tree *root;

int size(Tree *a){
	return a?a->size:0;
}

int minimum(Tree *a){
	return a?a->min:INF;
}

Tree* update(Tree *a){
	if(a == 0)return 0;
	a->size = size(a->r) + size(a->l) + 1;
	a->min = min(a->val, min(minimum(a->r), minimum(a->l)));
	a->index = size(a->l);
	return a;
}

Tree *merge(Tree *a, Tree *b){
	int p = size(a), q = size(b);
	if(p == 0)return b;
	if(q == 0)return a;
	if(rand()%(p+q) < p){
		Tree *tmp = merge(a->r, b);
		a->r = tmp;
		return update(a);
	}
	else{
		Tree *tmp = merge(a, b->l);
		b->l = tmp;
		return update(b);
	}

}

PTree split(Tree *a, int pos){
	if(pos == 0)return PTree(0, a);
	if(size(a) == pos)return PTree(a, 0);
	if(size(a->l) < pos){
		PTree tmp = split(a->r, pos - 1 - size(a->l));
		a->r = tmp.first;
		tmp.first = update(a);
		return tmp;
	}
	else{
		PTree tmp = split(a->l, pos);
		a->l = tmp.second;
		tmp.second = update(a);
		return tmp;
	}
}

Tree *insert(Tree *a, int pos, int val){
	PTree tmp = split(a, pos);
	tmp.first = merge(tmp.first, new Tree(val));
	return merge(tmp.first, tmp.second);
}

Tree *erase(Tree *a, int pos){
	PTree tmp = split(a, pos);
	return merge(tmp.first, split(tmp.second, 1).second);
}

int minval(Tree *a, int left, int right){
	if(left <= 0 && size(a) <= right)return minimum(a);
	if(right <= 0 || size(a) <= left)return INF;
	int lmin = minval(a->l, left, right);
	int rmin = minval(a->r, left - size(a->l) - 1, right - size(a->l) - 1);
	int res = min(lmin, rmin);
	if(left <= a->index && a->index < right)res = min(a->val, res);
	return res;
}

Tree *changeval(Tree *a, int pos, int val){
	if(a->index == pos){
		a->val = val;
	}
	if(a->index < pos){
		changeval(a->r, pos - size(a->l) - 1, val);
	}
	if(a->index > pos){
		changeval(a->l, pos, val);
	}
	return update(a);
}

int value(Tree *a, int pos){
	if(a->index == pos){
		return a->val;
	}
	if(a->index < pos){
		return value(a->r, pos - size(a->l) - 1);
	}
	if(a->index > pos){
		return value(a->l, pos);
	}
}


int main(){
	int n, q, num, x, y, z;
	cin >> n >> q;
	cin >> num;
	root = new Tree(num);
	for(int i = 1;i < n;i++){
		cin >> num;
		root = merge(root, new Tree(num));
	}
	for(int i = 0;i < q;i++){
		cin >> x >> y >> z;
		if(x == 0){
			int num = value(root, z);
			root = erase(root, z);
			root = insert(root, y, num);
		}
		if(x == 1){
			cout << minval(root, y, z + 1) << endl;
		}
		if(x == 2){
			root = changeval(root, y, z);
		}
	}
	return 0;
}