Codeforces-368B-Sereja and Suffixes
来源:互联网 发布:知凡生物 编辑:程序博客网 时间:2024/05/21 11:25
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,问从x到n有多少个不同是数
题解:简单hash运用
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;int main(){ int n,m; int a[100005]; int b[100005]; int Hash[100005]; while(scanf("%d%d",&n,&m)!=EOF) { int cnt=0; memset(Hash,0,sizeof(Hash)); for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int i=n;i>=1;i--) { if(!Hash[a[i]]) cnt++; Hash[a[i]]=1; b[i]=cnt; } while(m--) { int x; scanf("%d",&x); printf("%d\n",b[x]); } } return 0;}
- CodeForces 368B Sereja and Suffixes
- CodeForces 368B-Sereja and Suffixes【模拟】
- Codeforces 368B Sereja and Suffixes
- CodeForces 368B:Sereja and Suffixes【水】
- Codeforces-368B-Sereja and Suffixes
- 【codeforces 368B Sereja and Suffixes】+ 预处理
- CodeForces 368B Sereja and Suffixes
- codeforces 368 B. Sereja and Suffixes
- codeforces 368B B. Sereja and Suffixes(树状数组)
- Codeforces 368B Sereja and Suffixes(map去重)
- Codeforces 368B Sereja and Suffixes 线段树按值建树
- CodeForces - 368B Sereja and Suffixes (map)
- Codeforces 368B:Sereja and Suffixes(水题)
- B. Sereja and Suffixes
- coderforce --B. Sereja and Suffixes
- Codeforces Round #215 (diy.2) B.Sereja and Suffixes
- Codeforces Round #215 (Div. 2) -B. Sereja and Suffixes
- Codeforces Round #215 (Div. 2) -B. Sereja and Suffixes
- nginx、apache实现代理功能与直接访问node.js站点
- 喵播直播项目详解
- 什么叫工业4.0,这篇接地气的文章终于讲懂了
- 自己实现strcpy,strncpy,strncat,strcmp,strlen的功能
- 源码角度讲解子线程创建Handler报错的原因
- Codeforces-368B-Sereja and Suffixes
- javascript编码规范
- rails 路由
- EDA软件_Protel99se生成gerber文件
- LIGHT OJ 1179 - Josephus Problem【约瑟夫(模板)】
- cancel事件
- 嵌入式培训第二阶段 第一星期 no.1 标准 I / O
- How to install Oh My Zsh on Ubuntu 14
- jmeter(三)maven 和jenkins