Sereja and Suffixes
2016-03-30 22:11
351 查看
J - 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
题目分析:
这个题目应该是好读懂的,
10 10
10 这个数列有10个元素
10 有10个数据测试
1 数列从第一个数开始到最后有多少个不同的数 6(自己数一下)
2 数列从第二个数开始到最后有多少个不同的数 6
3 数列从第三个数开始到最后有多少个不同的数 6
.
7 数列从第7 个数开始到最后有 多少个不同的数 4
.
10 数列从第10个数开始到最后有多少个不同的数 1
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
题目分析:
这个题目应该是好读懂的,
10 10 1 2 3 4 1 2 3 4 100000 99999 1 2 3 4 5 6 7 8 9 10
10 10
10 这个数列有10个元素
10 有10个数据测试
1 数列从第一个数开始到最后有多少个不同的数 6(自己数一下)
2 数列从第二个数开始到最后有多少个不同的数 6
3 数列从第三个数开始到最后有多少个不同的数 6
.
7 数列从第7 个数开始到最后有 多少个不同的数 4
.
10 数列从第10个数开始到最后有多少个不同的数 1
#include<cstdio> #include<cstring> #include<algorithm> #define maxn 100010 using namespace std; int a[maxn],b[maxn],c[maxn]; int main() { int n,m; while(~scanf("%d%d",&n,&m)) { memset(b,0,sizeof(b)); memset(c,0,sizeof(c)); for(int i=0;i<n;i++) scanf("%d",&a[i]); int ans=0; for(int i=n-1;i>=0;i--) { if(!b[a[i]]) ans++; b[a[i]]=1; c[i]=ans; } // for(int i=0;i<n;i++) // printf("%d ",c[i]); // printf("\n"); int t; for(int i=0;i<m;i++) { scanf("%d",&t); printf("%d\n",c[t-1]); } } return 0; }
相关文章推荐
- UnicodeDecodeError: 'utf8' codec can't decode byte 0xb1 in position 0: invalid start byte
- Python基本语法
- 实验4 颜色、字符串资源的使用
- 20135316Linux内核学习笔记第六周
- 【转】关于分布式事务、两阶段提交协议、三阶提交协议
- 2016去哪儿编程题:表达式合法判断
- 包
- Chrome设置新标签页来打开链接
- 337. House Robber III
- 设计模式之享元模式
- git版本控制工具的学习
- linux配置java环境变量
- Handler 接收Parcelable ArrayList时返回空的错误
- Docker安装脚本源码解读
- 笔记 - Android - 6.上下文Context API
- ubuntu中安装docker
- 孤儿进程和僵尸进程
- mybatis 注解和xml的使用
- Maven使用详解(一)
- android Spinner控件详解