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

#define INF (1<<30)


class DynamicRMQ {
	struct Node {
		int height;
		Node *left, *right;
		int size;
		int val, minsub;

		Node(int k, int v)
			:height(1), left(0), right(0), size(1), val(v), minsub(v) {}
		~Node() {
			if (left)delete left;
			if (right)delete right;
		}
		Node *rotate_right() {
			Node *s = left;
			left = s->right;
			s->right = this;
			s->right->update();
			return s;
		}
		Node *rotate_left() {
			Node *s = right;
			right = s->left;
			s->left = this;
			s->left->update();
			return s;
		}
		Node *insert(int k, int v) {
			if (!this)return new Node(k, v);
			int si = left ? left->size : 0;
			if (k <= si) {
				left = left->insert(k, v);
			}
			else {//key < k
				right = right->insert(k - si - 1, v);
			}
			return balance();
		}

		Node *erase(int k) {
			if (!this)return NULL;
			int si = left ? left->size : 0;
			if (k == si) {
				Node *le = left, *ri = right;
				left = right = NULL;
				delete this;
				if (!le) {
					return ri;
				}
				if (!ri) {
					return le;
				}
				Node *t;
				le = le->erase_max(&t);
				t->left = le;
				t->right = ri;
				return t->balance();
			}
			if (k < si) {
				left = left->erase(k);
			}
			else if (si < k) {
				right = right->erase(k - si - 1);
			}
			return balance();
		}
		int min(int a, int b, int l, int r)const {
			if (!this || r<a || b<l)return INF;
			if (a <= l && r <= b)return minsub;
			int si = left ? left->size : 0;
			int res = a <= l + si&&l + si<b ? val : INF;
			res = std::min(res, left->min(a, b, l, l + si));
			res = std::min(res, right->min(a, b, l + si + 1, r));
			return res;
		}
		Node *balance() {
			int bf = (right ? right->height : 0) - (left ? left->height : 0);
			if (2 == bf) {
				Node *t = right;
				if ((t->right ? t->right->height : 0) < (t->left ? t->left->height : 0)) {
					right = t->rotate_right();
				}
				return rotate_left()->update();
			}
			else if (bf == -2) {
				Node *t = left;
				if ((t->right ? t->right->height : 0) > (t->left ? t->left->height : 0)) {
					left = t->rotate_left();
				}
				return rotate_right()->update();
			}
			return update();
		}
		Node *update() {
			update_height();
			update_size();
			update_min();
			return this;
		}
		void update_height() {
			if (!this)return;
			if (right) {
				if (left && right->height < left->height)height = left->height + 1;
				else height = right->height + 1;
			}
			else if (left)height = left->height + 1;
			else height = 1;
		}
		void update_size() {
			if (!this)return;
			size = 1 + (left ? left->size : 0) + (right ? right->size : 0);
		}
		void update_min() {
			if (!this)return;
			minsub = val;
			if (left)minsub = std::min(minsub, left->minsub);
			if (right)minsub = std::min(minsub, right->minsub);
		}
		Node* erase_max(Node **maxnode) {
			if (right) {
				right = right->erase_max(maxnode);
				return balance();
			}
			else {
				*maxnode = this;
				return left;
			}
		}
	} *root;
public:
	DynamicRMQ() :root(0) {}
	~DynamicRMQ() { if (root)delete root; }
	void insert(int k, int v) {
		root = root->insert(k, v);
	}
	void erase(int k) {
		root = root->erase(k);
	}
	void set(int k, int v) {
		root = root->erase(k);
		root = root->insert(k, v);
	}
	int min(int a, int b)const {//半開区間[a,b)
		return root->min(a, b, 0, root->size);
	}
};




int main() {
	int n, q;
	DynamicRMQ rmq;
	cin >> n >> q;
	for (int i = 0; i<n; i++) {
		int a;
		cin >> a;
		rmq.insert(i, a);
	}
	for (int i = 0; i<q; i++) {
		int x, y, z;
		cin >> x >> y >> z;
		if (x == 0) {
			int v = rmq.min(z, z + 1);
			rmq.erase(z);
			rmq.insert(y, v);
		}
		else if (x == 1) {
			cout << rmq.min(y, z + 1) << endl;
		}
		else {
			rmq.erase(y);
			rmq.insert(y, z);
		}
	}
	return 0;
}