B. Sereja and Suffixes 水题

水深无声 2021-12-11 08:01 244阅读 0赞

B. Sereja and Suffixes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sereja has an array *a*, consisting of *n* integers *a*1, *a*2, ..., *a**n*. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out *m* integers *l*1, *l*2, ..., *l**m* (1 ≤ *l**i* ≤ *n*). For each number *l**i* he wants to know how many distinct numbers are staying on the positions *l**i*, *l**i* + 1, ..., *n*. Formally, he want to find the number of distinct numbers among *a**l**i*, *a**l**i* + 1, ..., *a**n*.?

Sereja wrote out the necessary array elements but the array was so large and the boy was so pressed for time. Help him, find the answer for the described question for each *l**i*.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 105). The second line contains *n* integers *a*1, *a*2, ..., *a**n* (1 ≤ *a**i* ≤ 105) — the array elements.

Next *m* lines contain integers *l*1, *l*2, ..., *l**m*. The *i*\-th line contains integer *l**i* (1 ≤ *l**i* ≤ *n*).

Output

Print *m* lines — on the *i*\-th line print the answer to the number *l**i*.

Sample test(s)

input

10 10
    1 2 3 4 1 2 3 4 100000 99999
    1
    2
    3
    4
    5
    6
    7
    8
    9
    10

output

6
    6
    6
    6
    6
    5
    4
    3
    2
    1

int a[maxn];
    int l[maxn];
    int dp[maxn];
    int vis[maxn];
    int main() 
    {
        //freopen("in.txt","r",stdin);
        int n,m;
        while(cin>>n>>m)
        {
            repf(i,1,n) scanf("%d",&a[i]);
            repf(i,1,m) scanf("%d",&l[i]);
            clr(vis);
            int cnt = 0;
            repd(i,n,1)
            {
                if(!vis[a[i]])
                {
                    cnt++;
                    vis[a[i]] = 1;
                }
                dp[i] = cnt;
            }
                
            repf(i,1,m)
                cout<<dp[l[i]]<<endl;
        }
        return 0;
    }

转载于:https://www.cnblogs.com/DreamHighWithMe/p/3445368.html