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<ctime>
#include<ctime>
#include<map>
using namespace std;

#define INF (1 << 30)

struct treap_n{
  int value, pri, minimum, count;
  treap_n* right, *left;
  treap_n(int v){
    value = v;
    pri = rand() % INF;
    count = 1;
    minimum = v;
    right = left = 0;
  }
};

int node_count(const treap_n* r){
  if(r == 0)return 0;
  return r -> count;
}


int node_min(const treap_n* r){
  if(r == 0)return INF;
  return r -> minimum;
}

treap_n* update(treap_n* r){
  r -> count = node_count(r -> left) + node_count(r -> right) + 1;
  r -> minimum = min(node_min(r -> left), node_min(r -> right));
  r -> minimum = min(r -> minimum, r -> value);
  return r;
}

treap_n* merge(treap_n* a, treap_n *b){
  if(a == 0)return update(b);
  if(b == 0)return update(a);
  if(a -> pri > b -> pri){
    treap_n* tmp = a -> right;
    a -> right = merge(tmp, b);
    return update(a);
  }
  else{
    treap_n* tmp = b -> left;
    b -> left = merge(a, tmp);
    return update(b);
  }
}

pair<treap_n*, treap_n*> split(treap_n* r,int pos){
  if(r == 0) return make_pair((treap_n*)0, (treap_n*)0);
  int left_count = node_count(r -> left);
  if(pos > left_count){
    pair<treap_n*, treap_n*> tmp;
    tmp = split(r -> right, pos - left_count - 1);
    r -> right = tmp.first;
    return make_pair(update(r), tmp.second);
  }
  else{
    pair<treap_n*, treap_n*> tmp;
    tmp = split(r -> left, pos);
    r -> left = tmp.second;
    return make_pair(tmp.first, update(r));
  }
}

treap_n* insert(treap_n* r, int pos, treap_n* n){
  pair<treap_n*, treap_n*>tmp;
  tmp = split(r, pos - 1);
  r = merge(tmp.first, n);
  r = merge(r, tmp.second);
  return r;
}

treap_n* remove(treap_n* r,int pos){
  pair<treap_n*, treap_n*>tmp;
  tmp = split(r, pos - 1);
  r = merge(tmp.first, split(tmp.second, 1).second);
  return r;
} 

treap_n* node(treap_n* r, int pos){
  int left_count = node_count(r -> left);
  if(pos == left_count + 1){
    return r;
  }
  if(pos > left_count){
    return node(r -> right, pos - left_count - 1);
  }
  else{
    return node(r -> left, pos);
  }
}

treap_n* shift(treap_n* r, int left, int right){
  treap_n* tmp = node(r, right);
  r = remove(r, right);
  r = insert(r, left, tmp);
  return r;
}

int minimum(treap_n* r, int left, int right){
  pair<treap_n*, treap_n*> tmp1, tmp2 ;
  int res;
  tmp1 = split(r, left - 1);
  tmp2 = split(tmp1.second , right - left + 1);
  res = node_min(tmp2.first);
  r = merge(tmp1.first, merge(tmp2.first, tmp2.second));
  return res;
}

treap_n* change(treap_n* r, int pos, int val){
  r = remove(r, pos);
  r = insert(r, pos, new treap_n(val));
  return r;
}



int main(){
  int tmp, n, q, x, y, z;
  srand((unsigned int)time(0));
  cin >> n >> q;
  cin >> tmp;
  treap_n root(tmp);
  treap_n* r = &root;
  for(int i = 2;i <= n;i++){
    cin >> tmp;
    r = insert(r, i, new treap_n(tmp));
  }
  for(int i = 0;i < q;i++){
    cin >> x >> y >> z;
    if(x == 0){
      r = shift(r, y + 1, z + 1);
    }
    if(x == 1){
      cout << minimum(r, y + 1, z + 1) << endl;
    }
    if(x == 2){
      r = change(r, y + 1, z);
    }
  }
  return 0;
}