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>
using namespace std;
int a[10000005];

int main(void){
  int n,q;
  cin>>n>>q;
  for(int i = 0 ; i < n ; i ++)
    cin>>a[i];
  //for(int i = 0 ; i < n ; i ++)cout<<a[i]<<" ";
  //cout<<"ans"<<endl;
  int x,y,z,w;
  while(q--){
    cin>>x>>y>>z;
    switch(x){
    case 0:
      w = a[z];
      for(int i = z ; i > y ; i --)
	a[i] = a[i-1];
      a[y]=w;
      break;
    case 1:
      w = int(1e9);
      for(int i = y ; i <= z ; i ++)
	w = min(w,a[i]);
      //cout<<x<<" " <<y<<" " << z<< endl;
      cout<<w<<endl;
      break;
    case 2:
      a[y]=z;
      break;
    }
    //for(int i = 0 ; i < n ; i ++)cout<<a[i]<<" ";
    //cout<<endl;
  }
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
using namespace std;

typedef int ut;
const int INF = 1<<29;

struct Node {
	ut value, minum;
	//ut sum;
	int size;
	Node* lch;
	Node* rch;
	Node(ut v) : value(v), minum(v), size(1),lch(NULL), rch(NULL) {
		//sum = v;
	}
};

typedef pair<Node*, Node*> npr;

struct RBST {
	Node* root;
	
	RBST(){
		srand(time(NULL));
	}
	
	int size(Node* t) { return !t ? NULL : t->size; }
	//int sum(Node* t) { return !t ? NULL : t->sum; }
	int minum(Node* t) { return !t ? INF : t->minum; }
	
	Node* update(Node* t){
		t->size = size(t->lch) + size(t->rch) + 1;
		t->minum = min(t->value, min(minum(t->lch), minum(t->rch)));
		//t->sum = sum(t->lch) + sum(t->rch) + t->value;
		return t;
	}
	
	Node* merge(Node* l, Node* r){
		if(!l || !r)
			return !l ? r : l;

		int m = l->size, n = r->size;
		if(rand() % (m + n) < m){
			l->rch = merge(l->rch, r);
			return update(l);
		}
		else{
			r->lch = merge(l, r->lch);
			return update(r);
		}
	}
	
	npr split(Node* t, int k){ // [0, k), [k, n)
		if(!t)
			return npr(NULL, NULL);
		if(k <= size(t->lch)){
			npr s = split(t->lch, k);
			t->lch = s.second;
			return npr(s.first, update(t));
		}
		else{
			npr s = split(t->rch, k - size(t->lch) - 1);
			t->rch = s.first;
			return npr(update(t), s.second);
		}
	}
	
	Node* insert(Node* t, int k, ut v){
		npr tmp = split(t, k);
		Node *p = new Node(v);
		return merge(merge(tmp.first, p), tmp.second);
	}
	
	Node* erase(Node* t, int k){
		npr tmp = split(t, k);
		return merge(tmp.first, split(tmp.second, 1).second);
	}
	
	void shift(int l, int r){
		npr a = split(root, r);
		npr b = split(a.first, l);
		npr c = split(a.second, 1);
		
		root = merge(merge(b.first, c.first), merge(b.second, c.second));
	}
	
	ut min_query(int l, int r){
		npr a = split(root, l);
		npr b = split(a.second, r-l+1);
		ut ans = b.first->minum;
		root = merge(a.first, merge(b.first, b.second));
		return ans;
	}
	
	void update_value(int k, int v){
		root = erase(root, k);
		root = insert(root, k, v);
	}
};

int main() {
	RBST* rbst = new RBST();
	int N, Q, a, x, y, z;
	cin >> N >> Q;
	for(int i = 0; i < N; ++i){
		scanf("%d", &a);
		rbst->root = rbst->insert(rbst->root, i, a);
	}
	
	for(int i = 0; i < Q; ++i){
		scanf("%d%d%d", &x, &y, &z);
		if(x == 0){
			rbst->shift(y, z);
		}
		else if(x == 1){
			printf("%d\n", rbst->min_query(y, z));
		}
		else{
			rbst->update_value(y, z);
		}
	}
	return 0;
}