Sereja and Suffixes(思维)
2016-04-01 10:00
351 查看
Sereja and Suffixes
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
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 Input
Input
Output
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
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 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 题解:让求x到n的不同数字的个数;打表,对于m次询问,如果每次都暴力肯定超了,由于n是固定的,所以打下表,从后往前; 代码:
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<set> #include<map> using namespace std; const int MAXN = 1e5+100; class Ary{ public: int n,m; int a[MAXN]; int dp[MAXN]; set<int>st; Ary(int n,int m):n(n),m(m){ for(int i = 1; i <= n; i++){ cin >> a[i]; } } int work(){ int cnt = 0; for(int i = n; i >= 1; i--){ if(!st.count(a[i])){ cnt++; st.insert(a[i]); } dp[i] = cnt; } //cout << endl; } ~Ary(){ //cout << "对象毁灭" << endl; } }; int main(){ int n,m; while(~scanf("%d%d", &n, &m)){ Ary boy(n,m); int temp; boy.work(); while(m--){ scanf("%d",&temp); printf("%d\n",boy.dp[temp]); } } return 0; }
相关文章推荐
- MongoDB 日志太大怎么办?
- Debug Assertion Failed! (调出“调用栈”窗口)
- select into from 和 insert into select 的用法和区别
- windows2008系统端口如何手工开放
- 心灵鸡汤之20160401
- TestFileInputStream.java
- chmod
- tools.jar seems to be not in Android Studio
- 通过简单Dump能获得的基本信息
- 【笔记】 《js权威指南》- 第1章 JS概述 - 1.2 客户端JS
- 利用mybatis-generator自动生成代码
- WebView加载页面(URL、HTML、本地文件)
- 【Java集合源码剖析】Java集合框架
- Android LayoutInflater原理分析,带你一步步深入了解View(一)
- Linux设备树翻译计划
- Mysql索引会失效的几种情况分析
- mysql:innodb monitor(show engine innodb status)探秘
- Maven 下的spring框架(二配置运行)
- mysql Handler_read_rnd_next value 值超大(10G+)的处理
- hive试题