12299 - RMQ with Shifts(线段树单点更新、区间求最值)

该题由于每次操作所改动的数字个数较少，所以直接用单点更新就好了。

细节参见代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 10;
const int INF = 1000000000;
int n,m,a[maxn],q,ql,qr,p,v,minv[3*maxn],b[30];;
int query(int o, int L, int R) {
    int M = L + (R-L)/2, ans = INF;
    if(ql <= L && R <= qr) return minv[o];
    if(ql <= M) ans = min(ans,query(o*2, L, M));
    if(M < qr) ans = min(ans,query(o*2+1, M+1, R));
    return ans;
}
void update(int o, int L, int R) {
    int M = L + (R-L)/2;
    if(L == R) minv[o] = v;
    else {
        if(p <= M) update(o*2, L, M); else update(o*2+1, M+1, R);
        minv[o] = min(minv[o*2], minv[o*2+1]);
    }
}
char s[50];
int main() {
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n*3;i++) minv[i] = INF;
    for(int i=1;i<=n;i++) {
        scanf("%d",&a[i]);
        p = i; v = a[i];
        update(1,1,n);

    }
    while(q--) {
        scanf("%s",s);
        int len = strlen(s);
        int cnt = 0, u = 0;
        for(int i=6;i<len;i++) {
            if(s[i] == ','||s[i] == ')') {
                b[cnt++] = u; u = 0;
            }
            else u = u*10 + s[i] - '0';
        }
        if(s[0] == 's') {
            int res = a[b[0]];
            update(1,1,n);
            for(int i=0;i<cnt-1;i++) {
                p = b[i]; v = a[b[i+1]];
                update(1,1,n); a[p] = v;
            }
            p = b[cnt-1]; v = res;
            update(1,1,n); a[p] = v;
        }
        else {
            ql = b[0]; qr = b[1];
            printf("%d\n",query(1,1,n));
        }
    }
    return 0;
}