标签：integers Sereja contains li line array Suffixes

F - Sereja and Suffixes
Sereja has an array a, consisting of n integers a1, a2, …, an. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out m integers l1, l2, …, lm (1 ≤ li ≤ n). For each number li he wants to know how many distinct numbers are staying on the positions li, li + 1, …, n. Formally, he want to find the number of distinct numbers among ali, ali + 1, …, an.?

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 li.

Input
The first line contains two integers n and m (1 ≤ n, m ≤ 105). The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 105) — the array elements.

Next m lines contain integers l1, l2, …, lm. The i-th line contains integer li (1 ≤ li ≤ n).

Output
Print m lines — on the i-th line print the answer to the number li.

Examples
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

#include<stdio.h>
#include<string.h>
int main()
{
    int n,m,i,j,t;
    int a[222222],b[222222],c[222222];
    while(~scanf("%d %d",&n,&m))
    {
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        int sum=0;
        for(i=n;i>=1;i--)
        {
            if(b[a[i]]==0)
            {
                sum++;
                b[a[i]]=1;
            }
            c[i]=sum;
        }
        for(j=1;j<=m;j++)
        {
            scanf("%d",&t);
            printf("%d\n",c[t]);
        }
    }
    return 0;
}

标签：integers,Sereja,contains,li,line,array,Suffixes
来源： https://blog.csdn.net/qq_51676888/article/details/114042220

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。