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 <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
    int N, Q, M;
    cin >> N >> Q;
    M = int(sqrt(N)) + 1;
    vector<deque<int>> a;
    vector<int> b((N + M - 1) / M, 1 << 30);
    for (int i = 0; i < b.size(); ++i) {
        a.emplace_back(min(M, N - i * M));
        for (int& j : a.back()) {
            cin >> j;
            b[i] = min(b[i], j);
        }
    }
    for (int h = 0; h < Q; ++h) {
        int z, l, r;
        cin >> z >> l >> r;
        if (z == 0) {
            int p;
            int x = 0;
            for (int i = 0; i < a.size(); ++i) {
                if (r < x + a[i].size()) {
                    p = a[i][r - x];
                    a[i].erase(a[i].begin() + r - x);
                    b[i] = 1 << 30;
                    for (int j : a[i])
                        b[i] = min(b[i], j);
                    break;
                }
                x += a[i].size();
            }
            x = 0;
            for (int i = 0; i < a.size(); ++i) {
                if (l < x + a[i].size()) {
                    a[i].insert(a[i].begin() + l - x, p);
                    b[i] = 1 << 30;
                    for (int j : a[i])
                        b[i] = min(b[i], j);
                    break;
                }
                x += a[i].size();
            }
        } else if (z == 1) {
            ++r;
            int mn = 1 << 30;
            int x = 0;
            for (int i = 0; i < a.size(); ++i) {
                int p = l < x ? 0 : l < x + a[i].size() ? 1 : 2;
                int q = r < x + a[i].size() ? 1 : 2;
                if (p == 1 || q == 1) {
                    int sz = min<int>(a[i].size(), r - x);
                    for (int j = max(0, l - x); j < sz; ++j)
                        mn = min(mn, a[i][j]);
                } else if (p == 0 && q == 2) {
                    mn = min(mn, b[i]);
                }
                if (q == 1) break;
                x += a[i].size();
            }
            cout << mn << endl;
        } else {
            int x = 0;
            for (int i = 0; i < a.size(); ++i) {
                if (l < x + a[i].size()) {
                    a[i][l - x] = r;
                    b[i] = 1 << 30;
                    for (int j : a[i])
                        b[i] = min(b[i], j);
                    break;
                }
                x += a[i].size();
            }
        }
        int i = int(Q / sqrt(N));
        if (h % (i + 1) == i) {
            vector<deque<int>> c(1);
            for (auto& p : a) {
                for (int i : p) {
                    if (c.back().size() == M)
                        c.emplace_back(deque<int>());
                    c.back().emplace_back(i);
                }
            }
            a = move(c);
            for (int i = 0; i < a.size(); ++i) {
                b[i] = 1 << 30;
                for (int j : a[i])
                    b[i] = min(b[i], j);
            }
        }
    }
    return 0;
}