Codeforces Round #215 (Div. 2) B. Sereja and Suffixes

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₁,a₂, ..., a_n. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote outm integers l₁, l₂, ..., l_m(1 ≤ l_i ≤ n). For each numberl_i he wants to know how many distinct numbers are staying on the positionsl_i,l_i + 1, ...,n. Formally, he want to find the number of distinct numbers amonga_li, a_li + 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 eachl_i.

Input

The first line contains two integers n andm (1 ≤ n, m ≤ 10⁵). The second line containsn integers a₁,a₂, ..., a_n(1 ≤ a_i ≤ 10⁵) — the array elements.

Next m lines contain integers l₁, l₂, ..., l_m. Thei-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 101 2 3 4 1 2 3 4 100000 9999912345678910

Output

6666654321

一道简单的题 ，用dp的思想

#include <iostream>#include <set>#include <cstdio>using namespace std;const int maxn=100000;int n,m,a[maxn+10],dp[maxn+10];set <int> mys;void initial(){     mys.clear();}void input(){     for(int i=0;i<n;i++){         scanf("%d",&a[i]);         dp[i]=0;     }}void computing(){     for(int i=n-1;i>=0;i--){          mys.insert(a[i]);          dp[i]=mys.size();     }     int l;     while(m-- >0){        scanf("%d",&l);        printf("%d\n",dp[l-1]);     }        }int main(){    while(scanf("%d%d",&n,&m)!=EOF){         initial();         input();         computing();    }    return 0; }