UVA 12299 RMQ with Shifts

线段树。单点更新，区间查询。就是说每次更新时，就按照题意，一个一个去修改。一开始我认为这样做会超时，跟队友商量了一下，也都认为会超时，但又想不到别的方法。。。。百度了一下，别人都说是水题，简单模板题，也都是这样做的。可能字符串长度不超过30使得更新的量不会太大，所以也不会TLE吧。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<map>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", s)
#define PC(n) printf("Case %d: ", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1e9+7;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const int N = 111111;
const int M = N << 2;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

int sum[M], a[N], b[33], num, n;
char s[33];

void pushup(int rt)
{
    sum[rt] = min(sum[rt << 1], sum[rt << 1 | 1]);
}

void build(int l, int r, int rt)
{
    if(l == r)
    {
        RI(a[l]);
        sum[rt] = a[l];
        return ;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    pushup(rt);
}

void update(int x, int v, int l, int r, int rt)
{
    if(l == r)
    {
        sum[rt] = v;
        return ;
    }
    int m = (l + r) >> 1;
    if(x <= m)update(x, v, lson);
    else update(x, v, rson);
    pushup(rt);
}

int query(int L, int R, int l, int r, int rt)
{
    if(L <= l && r <= R)return sum[rt];
    int m = (l + r) >> 1, ans = INFI;
    if(L <= m)ans = min(ans, query(L, R, lson));
    if(R > m) ans = min(ans, query(L, R, rson));
    return ans;
}

void deal()
{
    RS(s);
    int l = strlen(s);
    CLR(b, 0);
    num = 0;
    REP(i, l)
    {
        if(s[i] >= '0' && s[i] <= '9')
        {
            while(s[i] >= '0' && s[i] <= '9')b[num] = b[num] * 10 + s[i++] - '0';
            num++;
        }
    }
    if(s[0] == 'q')PI(query(b[0], b[1], 1, n, 1));
    else
    {
        int k = a[b[0]];
        REP(i, num - 1)a[b[i]] = a[b[i + 1]];
        a[b[num - 1]] = k;
        REP(i, num)update(b[i], a[b[i]], 1, n, 1);
    }
}

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int m;
    while(RII(n, m) != EOF)
    {
        num = 1;
        build(1, n, 1);
        while(m--)deal();
    }
    return 0;
}