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 <bits/stdc++.h>
#define int long long
#define INF 1e+18
using namespace std;

unsigned int randxor(){
	static unsigned int x = 1239732;
	x ^= (x << 13);
	x ^= (x >> 7);
	x ^= (x << 17);
	return x;
}

struct node{
	int dat,val,size;
	node *lch,*rch;
	node(int v){
		dat = v;
		val = v;
		lch = 0;
		rch = 0;
		size = 1;
	}
};

int siz(node *t){
	if(!t) return 0;
	return t->size;
}

int dat(node *t){
	if(!t) return INF;
	return t->dat;
}

node* update(node *t){
	t->size = siz(t->lch) + siz(t->rch) + 1;
	t->dat = min(t->val,min(dat(t->lch),dat(t->rch)));
	return t;
}

node* merge(node *x,node *y){
	if(!x) return y;
	if(!y) return x;
	if(randxor() % (x->size + y->size) < x->size){
		x->rch = merge(x->rch,y);
		return update(x);
	}else{
		y->lch = merge(x,y->lch);
		return update(y);
	}
}

typedef pair<node*,node*> P;

P split(node *x,int k){
	if(!x) return P(0,0);
	if(k <= siz(x->lch)){
		P tmp = split(x->lch,k);
		x->lch = tmp.second;
		return P(tmp.first,update(x));
	}else{
		P tmp = split(x->rch,k - siz(x->lch) - 1);
		x->rch = tmp.first;
		return P(update(x),tmp.second);
	}
}

void insert(node **x,int k,node *v){
	P tmp = split(*x,k);
	*x = merge(tmp.first,merge(v,tmp.second));
}

node* erase(node **x,int k){
	P p1 = split(*x,k),p2 = split(p1.second,1);
	*x = merge(p1.first,p2.second);
	return p2.first;
}

void update(node **x,int k,int v){
	P p1 = split(*x,k),p2 = split(p1.second,1);
	p2.first->val = v;
	update(p2.first);
	*x = merge(p1.first,merge(p2.first,p2.second));
}

int get(node **x,int l,int r){
	P p1 = split(*x,l),p2 = split(p1.second,r - l);
	int ret = p2.first->dat;
	*x = merge(p1.first,merge(p2.first,p2.second));
	return ret;
}

signed main(){
	int n,q;
	node *tree = 0;
	cin >> n >> q;
	for(int i = 0;i < n;i++){
		int a;
		cin >> a;
		tree = merge(tree,new node(a));
	}
	for(int i = 0;i < q;i++){
		int x,l,r;
		cin >> x >> l >> r;
		if(!x) insert(&tree,l,erase(&tree,r));
		else if(x == 1) cout << get(&tree,l,r + 1) << endl;
		else update(&tree,l,r);
	}
	return 0;
}