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 <cstdlib>
#include <algorithm>
#include <fstream>
using namespace std;

const int INF=1<<30;
class Treap{
public:
  struct node_t{
    int val;// 値
    node_t *lch,*rch;// l,r
    int pri;// 優先度
    int cnt;// 部分木のサイズ
    int sum;// 部分木の値の和
    int minv;// 部分木の最小値
    node_t(int v,int p):val(v),pri(p),cnt(1),sum(v),minv(v){
      lch=rch=NULL;
    }
  };
  node_t* make_node(int val){
    return new node_t(val,rand());
  }
  int count(node_t *t){
    return !t?0:t->cnt;
  }
  int sum(node_t *t){
    return !t?0:t->sum;
  }
  int minimum(node_t *t){
    return !t?INF:t->minv;
  }
  node_t *update(node_t *t){
    t->cnt=count(t->lch)+count(t->rch)+1;
    t->sum=sum(t->lch)+sum(t->rch)+t->val;
    t->minv=min(t->val,min(minimum(t->lch),minimum(t->rch)));
    return t;
  }
  node_t *merge(node_t *l,node_t *r){
    if(!l||!r)return !l?r:l;
    // 優先順位が高い方を上に
    if(l->pri>r->pri){
      l->rch=merge(l->rch,r);
      return update(l);
    }
    else{
      r->lch=merge(l,r->lch);
      return update(r);
    }
  }
  // [0,k),[k,n)
  pair<node_t*,node_t*> split(node_t *t,int k){
    if(!t)return pair<node_t*,node_t*>(NULL,NULL);
    if(k<=count(t->lch)){
      pair<node_t*,node_t*> s=split(t->lch,k);
      t->lch=s.second;
      return make_pair(s.first,update(t));
    }
    else{
      pair<node_t*,node_t*> s=split(t->rch,k-count(t->lch)-1);
      t->rch=s.first;
      return make_pair(update(t),s.second);
    }
  }
  // [l,r)の最小値を計算
  int range_min_value(node_t *t,int l,int r){
    if(r<=l)return INF;
    // 範囲と個数が一致
    if(r-l==count(t))
      return minimum(t);
    // 左の子に完全に含まれる
    else if(count(t->lch)>=r)
      return range_min_value(t->lch,l,r);
    // 右の子に完全に含まれる
    else if(count(t->lch)<l)
      return range_min_value(t->rch,l-(count(t->lch)+1),r-(count(t->lch)+1));
    // 左と右に場合分けする
    return min(t->val,min(range_min_value(t->lch,l,count(t->lch))
                          ,range_min_value(t->rch,0,r-(count(t->lch)+1))));
  }
};

Treap tp;
int main(){
  ifstream cin("in.txt");
  Treap::node_t *root=NULL;
  int N,Q;
  cin>>N>>Q;
  for(int i=0;i<N;i++){
    int a;
    cin>>a;
    root=tp.merge(root,tp.make_node(a));
  }
  // cout<<tp.range_min_value(root,5,6)<<endl;
  //cout<<tp.range_min_value(root,5,7)<<endl;
  //return 0;
  for(int i=0;i<Q;i++){
    int x,y,z;
    cin>>x>>y>>z;
    if(x==0){
      pair<Treap::node_t*,Treap::node_t*> p1=tp.split(root,y);
      pair<Treap::node_t*,Treap::node_t*> p2=tp.split(p1.second,z-y+1);
      Treap::node_t* a=p1.first;
      Treap::node_t* b=p2.first;
      Treap::node_t* c=p2.second;
      pair<Treap::node_t*,Treap::node_t*> p3=tp.split(b,z-y);
      b=tp.merge(p3.second,p3.first);
      root=tp.merge(tp.merge(a,b),c);
      // for(int i=0;i<N;i++){
      //   cout<<tp.range_min_value(root,i,i+1)<<endl;
      // }
      // cout<<endl;
    }
    else if(x==1){
      cout<<tp.range_min_value(root,y,z+1)<<endl;
    }
    else if(x==2){
      pair<Treap::node_t*,Treap::node_t*> p1=tp.split(root,y);
      pair<Treap::node_t*,Treap::node_t*> p2=tp.split(p1.second,1);
      delete p2.first;
      root=tp.merge(p1.first,tp.make_node(z));
      root=tp.merge(root,p2.second);
    }
  }
  
  
  return 0;
}