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 <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define EQ(a,b) (abs((a)-(b))<eps)
struct node
{
	int val;     // value of this node
	double pri;  // priority selected randomly
	int size;    // size of tree
	int mini;     // min,max,sum etc.
	node *lch,*rch;
	node(int v,double p):val(v),pri(p),size(1),mini(v)
	{
		lch = NULL;
		rch = NULL;
	}
};
typedef pair<node*,node*> Np;
int size(node *v){return !v?0:v->size;}
int mini(node *v){return !v?INF:v->mini;}
node* update(node *v)
{
	v->size = size(v->lch)+size(v->rch)+1;
	v->mini = min(min(mini(v->lch),mini(v->rch)),v->val);
	return v;
}
node* merge(node *l,node *r)
{
	if(!l||!r)return !l?r:l;
	if(l->pri > r->pri)
	{
		l->rch = merge(l->rch,r);
		return update(l);
	}
	else
	{
		r->lch = merge(l,r->lch);
		return update(r);
	}
}
Np split(node *v,int k) //[0,k),[k,n)
{
	if(!v)return Np(NULL,NULL);
	if(k<=size(v->lch))
	{
		Np s = split(v->lch,k);
		v->lch = s.sec;
		return mp(s.fi,update(v));
	}
	else
	{
		Np s = split(v->rch,k-size(v->lch)-1);
		v->rch = s.fi;
		return mp(update(v),s.sec);
	}
}
node* insert(node* v,int k,int val,double pri)
{
	if(!v)return new node(val,pri);
	Np s = split(v,k);
	node* x = new node(val,pri);
	return merge(merge(s.fi,x),s.sec);
}
//jissou kaizen no yochi ari.(kesareta node wo delete) 
Np erase(node* v,int k) // remain,erased
{
	Np sr = split(v,k+1);
	Np sl = split(sr.fi,k);
	return mp(merge(sl.fi,sr.sec),sl.sec);
}
node *root;
int n,q;
int main()
{
	srand((unsigned int)time(NULL));
	scanf("%d %d",&n,&q);
	root = NULL;
	for(int i=0;i<n;i++)
	{
		int x;
		scanf("%d",&x);
		root = insert(root,i,x,(double)rand());
	}
	for(int i=0;i<q;i++)
	{
		int type,l,r,pos,val;
		scanf("%d %d %d",&type,&l,&r);
		pos = l;
		val = r;
		if(type==0)
		{
			Np s1 = split(root,l);
			Np s2 = split(s1.sec,r-l+1);
			Np s3 = split(s2.fi,r-l);
			root = merge(merge(s1.fi,merge(s3.sec,s3.fi)),s2.sec);
		}
		else if(type==1)
		{
			Np s1 = split(root,l);
			Np s2 = split(s1.sec,r-l+1);
			printf("%d\n",mini(s2.fi));
			root = merge(s1.fi,merge(s2.fi,s2.sec));
		}
		else
		{
			Np s1 = split(root,pos);
			Np s2 = split(s1.sec,1);
			node* newnode = new node(val,(double)rand());
			root = merge(merge(s1.fi,newnode),s2.sec);
		}
	}
	return 0;
}