zoukankan      html  css  js  c++  java
  • codeforces 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.

    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

     题目的意思为第一行输入n和m,第二行输入n个数,然后输入m行数字,依次输出每个数字对应的n个数中不重复的数字的个数。

    #include<iostream>
    #include<map>
    #define MAXN 100005
    using namespace std;
    map<int, int> mp;
    int main()
    {
        int n, m, num;
        cin >> n >> m;
        int number[MAXN],l[MAXN];
        memset(l, 0, sizeof(l));
        for (int i = 0;i < n;i++)
            cin >> number[i];
        for (int i = n - 1;i >= 0;i--)
        {
            mp[number[i]]++;
            if (mp[number[i]] == 1)
                l[i] = l[i + 1] + 1;
            else
                l[i] = l[i + 1];
        }
        for (int i = 0;i < m;i++)
        {
            cin >> num;
            cout << l[num-1] << endl;
        }
        return 0;
    }
  • 相关阅读:
    params可变参数
    using释放资源
    第二章:深入C#数据类型
    体检套餐项目解析
    堆栈
    C#必看:《第17章节QQ管理系统》
    C#必看:《第15章节学生管理系统》
    ACM hdu 1008 Elavator
    jq尺寸和位置总结篇(width scrollTop position offset)
    find children slice
  • 原文地址:https://www.cnblogs.com/chenruijiang/p/8259698.html
Copyright © 2011-2022 走看看