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

#define rep(i, n)      reps (i, 0, n)
#define reps(i, f, n)  for (int i = f; i < int(n); ++i)

struct Node
{
    Node *par, *lch, *rch;
    int val, mini, cnt;
    Node() {
        par = lch = rch = NULL;
        val = mini = 0;
        cnt = 1;
    }
};

typedef pair<Node*, Node*> PPNode;

int getcnt(Node *t) { return t ? t->cnt : 0; }
int getmin(Node *t) { return t ? t->mini : 1 << 29; }

Node* update(Node *t)
{
    t->cnt = getcnt(t->lch) + getcnt(t->rch) + 1;
    t->mini = min(min(getmin(t->lch), getmin(t->rch)), t->val);
    return t;
}

void rotate(Node *t)
{
    Node *p = t->par;
    if (p->lch == t) {
        p->lch = t->rch; t->rch = p;
        if (p->lch) p->lch->par = p;
    } else {
        p->rch = t->lch; t->lch = p;
        if (p->rch) p->rch->par = p;
    }
    t->par = p->par; p->par = t;
    if (t->par) (t->par->lch == p ? t->par->lch : t->par->rch) = t;
    update(p);
}

Node* splay(Node *t) 
{
    while (t->par) {
        Node *p = t->par, *g = p->par;
        if (g) rotate((p->lch == t) == (g->lch == p) ? p : t);
        rotate(t);
    }
    return update(t);
}

Node* find(Node *t, int k)
{
    int c = getcnt(t->lch);
    if (k == c)     return t;
    else if (k < c) return find(t->lch, k);
    else            return find(t->rch, k - c - 1);
}

Node* merge(Node *l, Node *r)
{
    if (!l || !r) return l ? l : r;
    r = splay(find(r, 0));
    l->par = r; r->lch = l;
    return update(r);
}

PPNode split(Node *t, int k)
{
    if (k == t->cnt) return PPNode(t, NULL);
    t = splay(find(t, k));
    Node *s = t->lch;
    if (s) s->par = t->lch = NULL;
    return PPNode(s, update(t));
}

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    int n, q, a, x, y, z;
    cin >> n >> q;
    vector<Node> node(n);
    Node *root = NULL;
    rep (i, n) {
        cin >> a;
        node[i].val = node[i].mini = a;
        root = merge(root, &node[i]);
    }
    rep (i, q) {
        cin >> x >> y >> z;
        if (x == 0) {
            PPNode p1 = split(root, y);
            PPNode p2 = split(p1.second, z - y);
            PPNode p3 = split(p2.second, 1);
            root = merge(p1.first, p3.first);
            root = merge(root, p2.first);
            root = merge(root, p3.second);
        } else if (x == 1) {
            PPNode p1 = split(root, y);
            PPNode p2 = split(p1.second, z - y + 1);
            cout << p2.first->mini << endl;
            root = merge(p1.first, p2.first);
            root = merge(root, p2.second);
        } else {
            root = splay(find(root, y));
            root->val = z;
            update(root);
        }
    }
}