【留坑】uva12299

这么sb的题本来想练练手记过就是过不了

拍半天也没问题

留坑

哪天有空了去linux下面试试

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>

using namespace std;
template<typename Q> bool read(Q& x) {
    static char c, f;
    for(f = 0; c = getchar(), !isdigit(c); ) if(c == '-') f = 1;
    for(x = 0; isdigit(c); c = getchar()) x = x * 10 + c - '0';
    if(f) x = -x; return c != ')';
}
template<typename Q> Q read() {
    static Q x; read(x); return x;
}

const int N = 100000 + 10;

int a[N], n;

struct SegmentTree {
    int da[N * 4];
    
    #define mid ((l + r) >> 1)
    #define ls s << 1, l, mid
    #define rs s << 1 | 1, mid + 1, r
    
    void build(int s, int l, int r) {
        if(l == r) return da[s] = a[l], void();
        build(ls), build(rs);
        da[s] = min(da[s << 1], da[s << 1 | 1]);
    }
    
    int lft, rgt, w;
    
    int query(int s, int l, int r) {
        if(lft <= l && r <= rgt) return da[s];
        if(rgt <= mid) return query(ls);
        if(mid < lft) return query(rs);
        return min(query(ls), query(rs));
    }
    
    void modify(int s, int l, int r) {
        if(l == lft) return da[s] = w, void();
        if(lft <= mid) modify(ls); else modify(rs);
        da[s] = min(da[s << 1], da[s << 1 | 1]);
    }
    
    int Q(int l, int r) {
        return lft = l, rgt = r, query(1, 1, n);
    }
    
    void M(int p, int w) {
        lft = p, this->w = w;
        modify(1, 1, n);
    }
}seg;

int b[N], tot;

char enter[1000000];

int main() {
#ifdef DEBUG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    
    int m, l, r, x;
    read(n), read(m);
    for(int i = 1; i <= n; i++) {
        read(a[i]);
    }
    seg.build(1, 1, n);
//    gets(enter);
    char opt[10000];
    
    for(int i = 1; i <= m; i++) {
//        fprintf(stderr, "%d
", i);
        scanf("%[^(]", opt);
        if(opt[0] == 'q') {
            read(l), read(r);
            printf("%d
", seg.Q(l, r));
        }else {
            tot = 0;
            while(1) {
                int t = read(x);
                b[tot++] = x;
                if(!t) break;
            }
            if(tot == 1) continue;
            reverse(b, b + tot);
            int last = a[b[tot - 1]];
            for(int i = 0; i < tot; i++) {
                seg.M(b[i], last);
                swap(a[b[i]], last);
            }
        }
        gets(enter);
    }
    
    return 0;
}