BZOJ 2083 Intelligence test

用vector，二分。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define maxn 1005000
using namespace std;
int n,a[maxn],t,m,b[maxn];
vector <int> v[maxn];
int read()
{
    char ch;int data=;
    while (ch<'' || ch>'') ch=getchar();
    while (ch>='' && ch<='')
    {
        data=data*+ch-'';
        ch=getchar();
    }
    return data;
}
int find(int x,int y)
{
    int l=,r=v[x].size()-,ans=-;
    while (l<=r)
    {
        int mid=l+r>>;
        if (v[x][mid]>y) {ans=v[x][mid];r=mid-;}
        else l=mid+;
    }
    return ans;
}
void work()
{
    m=read();int ret=;
    for (int i=;i<=m;i++) b[i]=read();
    for (int i=;i<=m;i++)
    {
        ret=find(b[i],ret);
        if (ret==-) {printf("NIE\n");return;}
    }
    printf("TAK\n");
}
int main()
{
    n=read();
    for (int i=;i<=n;i++)
    {
        a[i]=read();
        v[a[i]].push_back(i);
    }
    t=read();
    for (int i=;i<=t;i++)
        work();
    return ;
}