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>
using namespace std;
const int INF = 1 << 30;
struct Treap {
  struct node{
    int value; // 値
    node *left, *right; // *左, *右:
    int priority; // 優先度
    int cnt; // 部分木のサイズ
    //  int sum; // 部分木の和
    int small; //部分木の最小値
    node( int v) : value(v), priority(rand()), cnt(1), /*sum(v),*/ small(v){
      left = right = NULL;
    }
  };
 
  node *root;
  Treap():root(NULL){}
 
  int count( node *t){ return !t ? 0 : t->cnt; }
  //int sum( node *t)  { return !t ? 0 : t->sum; }
  int mini( node *t) { return !t ? INF : t->small; }
 
  node* update( node* t) {
    t -> cnt = count( t -> left) + count( t -> right) + 1;
    // t -> sum = sum( t -> left) + sum( t -> right) + t -> value;
    t -> small = min( min( mini( t -> left), mini( t -> right)), t -> value);
    return t;
  }
  node* merge( node* l, node* r){
    if(!l || !r) return l? l : r;
    if(l -> priority > r -> priority) {
      l -> right = merge( l -> right, r);
      return update(l);
    } else {
      r -> left = merge( l, r -> left);
      return update(r);
    }
  }
  pair< node*, node* > split( node* t, int k){ // [0,k),[k,n)
    if(!t) return make_pair((node*)NULL,(node*)NULL);
    if(k <= count( t -> left)){
      pair< node*, node* > s = split( t -> left, k);
      t -> left = s.second;
      return make_pair( s.first, update(t));
    }else{
      pair< node*, node* > s = split( t -> right, k - count( t -> left) - 1);
      t -> right = s.first;
      return make_pair( update(t), s.second);
    }
  }
 
  node* insert( node* t, int k, int val){
    pair< node*, node* > s = split( t, k);
    t = merge( s.first, new node( val));
    return update(merge( t, s.second));
  }
 
  node* erase( node* t, int k){
    pair< node*, node* > s1, s2;
    s1 = split( t, k + 1);
    s2 = split( s1.first, k);
    t = merge( s2.first, s1.second);
    return update(t);
  }
 
  node* find( node* t, int k){
    int c = count(t -> left);
    if(k < c)       return find( t -> left, k);
    else if(k > c)  return find( t -> right, k - c - 1);
    else return t;
  }
 
  int rmq( node* t, int l, int r){
    if(l >= count(t) || r <= 0) return INF;
    if(l <= 0 && r >= count(t)) return mini(t);
 
    int size = count( t -> left);
    int ret = min( rmq( t -> left, l, r),  rmq( t -> right, l - size - 1, r - size - 1));
    if(l <= size && size < r) ret = min( ret, t -> value);
    return ret;
  }
  void insert( int k, int v){ root = insert( root, k, v);}
  void erase( int k) { root = erase( root, k);}
  node* find( int k) { return find( root, k); }
  int rmq( int l, int r){ return rmq( root, l, r); }
};
 
int main(){
  int n, q;
  Treap tree;
 
  scanf("%d %d", &n, &q);
  for(int i = 0, a ; i < n ; i++ ){
    scanf("%d", &a);
    tree.insert( i, a);
  }
  while(q--){
    int x, y, z;
    scanf("%d %d %d", &x, &y, &z);
    if(x == 0){
      z++;
      pair< Treap::node*, Treap::node* > a, b, c;
      c = tree.split( tree.root, z);     // [0,z) [z,n)
      b = tree.split( c.first , z - 1);  // [0,z - 1) [z-1,z)
      a = tree.split( b.first , y);     //  [0,y) [y,z-1)
 
      tree.root = tree.merge( a.first, b.second); // [0,z) + [z-1,z)
      tree.root = tree.merge( tree.root, a.second); // root + [y,z-1)
      tree.root = tree.merge( tree.root, c.second); // root + [z,n)
 
      //ふええふえぇふぇぇ(むずかしいね
    } else if(x == 1){
      z++;

      pair< Treap::node*, Treap::node* > p, q;
      p = tree.split( tree.root, y);
      q = tree.split( p.second, z - y);
      printf("%d\n", tree.mini(q.first));
      tree.root = tree.merge( p.first, tree.merge( q.first, q.second));
    } else {
      tree.erase(y);
      tree.insert( y, z);
    }
  }