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)
#define size(x) (x?x->size:0)
#define nmin(x) (x?x->min:INF)

struct Node{
	int val, min, size;
	Node *l, *r;        
	Node(int x){
		val = x;
		min = x;
		size = 1;
		l = r = 0;	
	}	
};

Node *root = 0;
                    
typedef pair<Node*, Node*> P;
int vals[108000];
int p = 0;
void dfs(Node *a){
	if(a->l)dfs(a->l);
	vals[p++] = a->val;
	if(a->r)dfs(a->r);
}

void view(Node *a){
	p = 0;
	int s = size(a);
	dfs(a);
	for(int i = 0;i < p;i++){
		cout << vals[i] << " ";
	}cout << endl;
}

Node *update(Node *x){
	if(x == 0)return 0;
	x->min = min(x->val, min(nmin(x->l), nmin(x->r)));
	x->size = 1 + size(x->l) + size(x->r);
	return x;
}


Node *merge(Node *a, Node *b){
	if(a == 0)return b;
	if(b == 0)return a;
	int asize = size(a);
	int bsize = size(b);

	if(rand() % (asize + bsize) < asize){
		Node *tmp = merge(a->r, b);
		a->r = tmp;
		return update(a);
	}
	else{
		Node *tmp = merge(a, b->l);
		b->l = tmp;
		return update(b);
	}
}

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

Node *shift(Node *a, int l, int r){
	P tmp = split(a, r);
	P tmp2 = split(tmp.first, l);
	P tmp3 = split(tmp.second, 1);
	tmp2.first = merge(tmp2.first, tmp3.first);
	tmp.first = merge(tmp2.first, tmp2.second);
	return merge(tmp.first, tmp3.second);	
}

int minval(Node *a, int l, int r){
	P tmp = split(a, r + 1);
	P tmp2 = split(tmp.first, l);
	int res = nmin(tmp2.second);
	tmp.first = merge(tmp2.first, tmp2.second);
	root = merge(tmp.first, tmp.second);
	return res;
}

Node *setval(Node *a, int pos, int val){
	P tmp = split(a, pos);
	tmp.second = split(tmp.second, 1).second;
	tmp.second = merge(new Node(val), tmp.second);
	return merge(tmp.first , tmp.second);
}
	
int main(){
        int n, q, x, y, z;
	cin >> n >> q;
	for(int i = 0;i < n;i++){
		cin >> x;
		root = merge(root, new Node(x));
	}
	for(int i = 0;i < q;i++){
		cin >> x >> y >> z;
		int l = y, r = z;

		if(x == 0){
			root = shift(root, l, r);
		}
		if(x == 1){
			cout << minval(root, l, r) << endl;
		}
		if(x == 2){
			root = setval(root, y, z);
		}
	}
	return 0;
}