CF#215DIV2:B. Sereja and Suffixes
来源:互联网 发布:玩别人老婆知乎 编辑:程序博客网 时间:2024/05/23 20:21
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 outm integers l1, l2, ..., lm(1 ≤ li ≤ n). For each numberli he wants to know how many distinct numbers are staying on the positionsli,li + 1, ...,n. Formally, he want to find the number of distinct numbers amongali, 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 eachli.
The first line contains two integers n andm (1 ≤ n, m ≤ 105). The second line containsn integers a1,a2, ..., an(1 ≤ ai ≤ 105) — the array elements.
Next m lines contain integers l1, l2, ..., lm. Thei-th line contains integer li (1 ≤ li ≤ n).
Print m lines — on the i-th line print the answer to the number li.
10 101 2 3 4 1 2 3 4 100000 9999912345678910
6666654321
题意:给出a和b的数组,b数组中的数字是统计这个位置之后有几个不同的数字
思路:水题,哈希记录
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int n,m,a[100005],b[100005],hash[100005],ans[100005];int main(){ int i,j; while(~scanf("%d%d",&n,&m)) { memset(hash,0,sizeof(hash)); memset(ans,0,sizeof(ans)); int cnt = 0; for(i = 1; i<=n; i++) scanf("%d",&a[i]); for(i = n; i>=1; i--) { if(!hash[a[i]]) cnt++; hash[a[i]] = 1; ans[i] = cnt; } for(i = 1; i<=m; i++) scanf("%d",&b[i]); for(i = 1; i<=m; i++) printf("%d\n",ans[b[i]]); } return 0;}
- CF#215DIV2:B. Sereja and Suffixes
- CF#215 DIV2: B. Sereja and Suffixes
- CF#215DIV2:B. Sereja and Suffixes(哈希记录)
- B. Sereja and Suffixes
- coderforce --B. Sereja and Suffixes
- CF#215DIV2:C. Sereja and Algorithm
- 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
- Codeforces Round #215 (Div. 2) B. 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 368B Sereja and Suffixes
- codeforces 368 B. Sereja and Suffixes
- Recursion 求所有子集 @CareerCup
- msys 编译 openresty 记录(失败)
- linux学习笔记--鸟哥的linux私房菜第0章 计算机概论
- CF#215DIV2:A. Sereja and Coat Rack
- protel的一些记录
- CF#215DIV2:B. Sereja and Suffixes
- CF#215DIV2:C. Sereja and Algorithm
- codeforces Round #215 div2 题解
- CodeForce Round 215 DIV2 C 使用了线段树 但是多此一举...
- Codeforces Round #215 (Div. 1)
- 六百链网络收藏夹 博客正式开通!
- 黑马程序员_HashCode_框架_配置文件
- Django admin中使用Django-tinymce富文本编辑框
- Java同步问题