BZOJ2083 [Poi2010]Intelligence test

嘛= =本来这题各种神。。。要写好长的说

然后突然想起神马的c++的STL。。。直接水过了233

本蒟蒻：STL还真是强大！Orz

/**************************************************************
    Problem: 2083
    User: rausen
    Language: C++
    Result: Accepted
    Time:3780 ms
    Memory:28100 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
#include <vector>
 
using namespace std;
typedef vector <int> ::iterator Vect_it;
const int N = 1000005;
 
vector <int> v[N];
int n, Q;
int f, len, last;
 
inline int read() {
    int x = 0;
    char ch = getchar();
    while (ch < '0' || '9' < ch)
        ch = getchar();
    while ('0' <= ch && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x;
}
 
int main() {
    int i, x;
    n = read();
    for (i = 1; i <= n; ++i) {
        x = read();
        v[x].push_back(i);
    }
    Q = read();
    Vect_it IT;
    while (Q--) {
        f = 1, len = read(), last = 0;
        for (i = 1; i <= len; ++i) {
            x = read();
            if (f){
                IT = upper_bound(v[x].begin(), v[x].end(), last);
                if (IT == v[x].end()) f = 0;
                else last = *IT;
            }
        }
        if (f) puts("TAK");
        else puts("NIE");
    }
    return 0;
}

（p.s. Rank.13液！）