zoukankan      html  css  js  c++  java
  • cf 368B

    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 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 lili + 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.

    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
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<algorithm>
    #include<cstdlib>
    #include<set>
    using namespace std;
    set<int> s;
    int n,m,a[100010],ans[100010];
    int main()
    {
          scanf("%d%d",&n,&m);
          for(int i=1;i<=n;i++)
                scanf("%d",&a[i]);
          for(int i=n;i>=1;i--)
          {
                s.insert(a[i]);
                ans[i]=s.size();
          }
          int tt;
          while(m--)
          {
              scanf("%d",&tt);
              printf("%d
    ",ans[tt]);
          }
          return 0;
    }
    

      

  • 相关阅读:
    [唐诗]禅-虞世南
    监考
    弄了一个数学论坛,感觉不错,欢迎加入讨论
    中国科学院大学2016年高等代数考研试题
    中国科学院大学2016年数学分析考研试题
    北京大学2016年高等代数与解析几何考研试题
    北京大学2016年数学分析考研试题
    pedagogical
    2012年度江西省科学技术奖授奖项目名单
    2013年度江西省科学技术奖授奖项目名单
  • 原文地址:https://www.cnblogs.com/a972290869/p/4243562.html
Copyright © 2011-2022 走看看