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 REP(i,n) for(int i=0; i<(int)(n); ++i)

using namespace std;

struct Node{
    int val;
    double pri;
    int cnt;
    int sum;
    int min_v;
    Node* lch;
    Node* rch;

    Node(int v, double p) :
        val(v), pri(p), cnt(1), sum(v), min_v(v), lch(NULL), rch(NULL) {}
};

int count(Node* t) {
    return t ? t->cnt : 0;
}
int sum(Node* t) {
    return t ? t->sum : 0;
}
int min(Node* t) {
    return t ? t->min_v : INT_MAX;
}
int left(Node* t) {
    return t->lch ? t->lch->val : INT_MIN;
}
int right(Node* t) {
    return t->rch ? t->rch->val : INT_MIN;
}
Node* get(Node* t, int k) {
    int c = count(t->lch);
    if(k < c) {
        return get(t->lch, k);
    } else if(k > c) {
        return get(t->rch, k - (c + 1));
    } else {
        return t;
    }
}
void output(Node* t) {
    int n = count(t);
    REP(i, n) {
        cout << get(t, i)->val << " ";
    }
    cout << endl;
}

Node* update(Node* t) {
    t->cnt = count(t->lch) + count(t->rch) + 1;
    t->sum = sum(t->lch) + sum(t->rch);
    t->min_v = min(t->val, min( min(t->lch), min(t->rch) ));
    return t;
}

Node* merge(Node* l, Node* r) {
    if(!l || !r) return l ? l : r;

    if(l->pri > r->pri) {
        l->rch = merge(l->rch, r);
        return update(l);
    } else {
        r->lch = merge(l, r->lch);
        return update(r);
    }
}

pair<Node*, Node*> split(Node* t, int k) { // [0, k) [k, n)
    if(!t) return pair<Node*, Node*>(NULL, NULL);

    int c = count(t->lch);
    if(k <= c) {
        pair<Node*, Node*> s = split(t->lch, k);
        t->lch = s.second;
        return make_pair(s.first, update(t));
    } else {
        pair<Node*, Node*> s = split(t->rch, k - (c + 1));
        t->rch = s.first;
        return make_pair(update(t), s.second);
    }
}

Node* insert(Node* t, int k, int v) {
    auto p = split(t, k);
    return merge(merge(p.first, new Node(v, rand())), p.second);
}

Node* erase(Node* t, int k) {
    auto p1 = split(t, k);
    auto p2 = split(p1.second, 1);
    return merge(p1.first, p2.second);
}

int minimum(Node *t, int l, int r) {
    if(!t) return INT_MAX;
    int c = count(t->lch);
    int n = count(t);
    // [0, c - 1] c [c + 1, n - 1]
    if(l <= 0 && n - 1 <= r) {
        return min(t);
    }
    int res = INT_MAX;
    if(!(c - 1 < l || r < 0)) {
        res = min(res, minimum(t->lch, l, r));
    }
    if(l <= c && c <= r) {
        res = min(res, t->val);
    }
    if(!(r < c + 1 || n - 1 < l)) {
        int nl = l - (c + 1);
        int nr = r - (c + 1);
        res = min(res, minimum(t->rch, nl, nr));
    }
    //printf("[%d, %d] c = %d, n = %d t->val = %d left = %d right = %d -> %d\n", l, r, c, n, t->val, left(t), right(t), res);
    return res;
}

int main(){
    int n, q;
    while(cin >> n >> q) {
        Node* t = NULL;
        for(int i = 0; i < n; i++) {
            int a;
            cin >> a;
            t = insert(t, i, a);
        }
        for(int i = 0; i < q; i++) {
            int x, y, z;
            cin >> x >> y >> z;
            if(x == 0) {
                int v = get(t, z)->val;
                t = erase(t, z);
                //output(t);
                t = insert(t, y, v);
                //output(t);
            } else if(x == 1) {
                cout << minimum(t, y, z) << endl;
            } else if(x == 2) {
                t = erase(t, y);
                t = insert(t, y, z);
            }
            //output(t);
        }
    }
    return 0;
}