zoukankan      html  css  js  c++  java
  • B. Sereja and Suffixes(cf)

    http://codeforces.com/problemset/problem/368/B

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

    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
     1 #include <stdio.h>
     2 #include <string.h>
     3 const int N=100002;
     4 int hash[N],f[N],a[N],l[N];
     5 int main()
     6 {
     7     int n,m,cnt = 0;
     8     scanf("%d %d",&n,&m);
     9     memset(hash,0,sizeof(hash));
    10     for (int i = 1; i <= n; i++)
    11         scanf("%d",&a[i]);
    12     for (int i = 1; i <= m; i++)
    13         scanf("%d",&l[i]);
    14     for (int i = n; i >= 1; i--)
    15     {
    16         hash[a[i]]++;
    17         if (hash[a[i]]==1)
    18             cnt++;
    19         f[i] = cnt;//表示从i到n的不同的元素个数
    20     }
    21     for (int i = 1; i <= m; i++)
    22         printf("%d
    ",f[l[i]]);
    23     return 0;
    24 }
    View Code
  • 相关阅读:
    Tweet信息搜集工具tinfoleak
    Visual Studio 2017为Android APK包签名
    Arduino可穿戴教程之第一个程序——上传运行程序(四)
    基于NMAP日志文件的暴力破解工具BruteSpray
    CSS3边框圆角知识
    渐变的几个效果图
    错误类型
    prompt() 方法
    jQuery 遍历
    jquery的商品首页
  • 原文地址:https://www.cnblogs.com/lahblogs/p/3450364.html
Copyright © 2011-2022 走看看