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>

void listen_n_and_q(int &,int &);
void listen_each_a(std::vector<int> &,const int);

void listenAndExec_each_q(std::vector<int> &,const int);//以降、呼び出される関数は全てファンクタ
class shift_a
{
public:
	void operator()(std::vector<int> &);
};

class find_min
{
public:
	int operator()(std::vector<int> &);
};

class change_a
{
public:
	void operator()(std::vector<int> &);
};

//---------------main-------------------
int main()
{
	using namespace std;
	
	vector<int> a;
	int n,q;
	listen_n_and_q(n,q);
	a.reserve(n);//必要分を一度に確保した方が高速
	listen_each_a(a,n);
	
	listenAndExec_each_q(a,q);
	
	return 0;
}
//---------------------------------------

void listen_n_and_q(int &n,int &q)
{
	using namespace std;
	
	cin>>n>>q;
}

void listen_each_a(std::vector<int> &a,const int n)
{
	using namespace std;
	
	int tmp_num;
	for(int roop=0;roop<n;roop++)
	{
		cin>>tmp_num;
		a.push_back(tmp_num);
	}
}

void listenAndExec_each_q(std::vector<int> &a,const int q)
{
	using namespace std;
	
	shift_a exec_0;
	find_min exec_1;
	change_a exec_2;
	int kind_q;
	for(int roop=0;roop<q;roop++)
	{
		cin>>kind_q;
		switch(kind_q)
		{
		case 0:
			exec_0(a);
			break;
		case 1:
			cout<<exec_1(a)<<endl;
			break;
		case 2:
			exec_2(a);
			break;
		}
	}
}

/*insert使用（遅い？）
void shift_a::operator()(std::vector<int> &a)
{
	using namespace std;
	
	vector<int>::iterator itr=a.begin();
	int l,r;
	cin>>l>>r;
	itr+=l;
	a.insert(itr,a[r]);
	itr=a.begin();
	itr+=++r;
	a.erase(itr);
}
*/

void shift_a::operator()(std::vector<int> &a)
{
	using namespace std;
	
	int l,r;
	cin>>l>>r;
	
	int tmp_num=a[r];
	for(int roop=r-1;roop>=l;roop--)
	{
		a[roop+1]=a[roop];
	}
	a[l]=tmp_num;
}

int find_min::operator()(std::vector<int> &a)
{
	using namespace std;
	
	vector<int>::iterator l_itr=a.begin(),r_itr=a.begin(),result;
	int l,r;
	cin>>l>>r;
	l_itr+=l;r_itr+=r;
	
	result=min_element(l_itr,++r_itr);
	
	return *result;
}

void change_a::operator()(std::vector<int> &a)
{
	using namespace std;
	
	int pos,val;
	cin>>pos>>val;
	
	a[pos]=val;
}