zoukankan      html  css  js  c++  java
  • CodeForces 368B Sereja and Suffixes

    Sereja and Suffixes

    Time Limit: 1000ms
    Memory Limit: 262144KB
    This problem will be judged on CodeForces. Original ID: 368B
    64-bit integer IO format: %I64d      Java class name: (Any)
    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 Input

    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

    Source

     
    解题:傻逼离线查询
     
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int maxn = 100010;
     4 struct Query {
     5     int idx,ask;
     6 } Q[maxn];
     7 bool visib[maxn];
     8 int n,m,d[maxn],ret[maxn];
     9 bool cmp(const Query &a,const Query &b) {
    10     return a.ask > b.ask;
    11 }
    12 int main() {
    13     scanf("%d %d",&n,&m);
    14     for(int i = 0; i < n; ++i)
    15         scanf("%d",d+i);
    16     for(int i = 0; i < m; ++i) {
    17         scanf("%d",&Q[i].ask);
    18         Q[i].idx = i;
    19     }
    20     sort(Q,Q+m,cmp);
    21     for(int i = 0,j = n-1,cnt = 0; i < m && j >= 0; ++i) {
    22         while(j >= 0 && Q[i].ask - 1 != j) {
    23             if(!visib[d[j]]) {
    24                 cnt++;
    25                 visib[d[j]] = true;
    26             }
    27             j--;
    28         }
    29         if(j >= 0 && Q[i].ask - 1 == j) {
    30             if(!visib[d[j]]) {
    31                 cnt++;
    32                 visib[d[j]] = true;
    33             }
    34             ret[Q[i].idx] = cnt;
    35         }
    36     }
    37     for(int i = 0; i < m; ++i)
    38         printf("%d
    ",ret[i]);
    39     return 0;
    40 }
    View Code
  • 相关阅读:
    线性回归(linear regression)之监督学习
    hadoop学习笔记之倒排索引
    Java学习笔记之==与equals
    Java学习笔记之深入理解引用
    mysql
    mysql
    JAVA
    nio
    JVM
    java
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4617379.html
Copyright © 2011-2022 走看看