uva 11991 - Easy Problem from Rujia Liu?
来源:互联网 发布:服务器域名根目录 编辑:程序博客网 时间:2024/05/21 16:58
题意:给出一个包含n个整数的数组,你需要回答若干查询。每次询问两个整数k和v,输出从左到右第k个v的下标(数组下标从左到右编号为1-n)。
#include<cstdio>#include<vector>#include<map>using namespace std;int main(){map<int,vector<int> >p;int i,x,y,n,m;while(scanf("%d%d",&n,&m)!=EOF){p.clear();for(i=0;i<n;i++){scanf("%d",&y);if(!p.count(y)) p[y]=vector<int>();p[y].push_back(i+1);}for(i=0;i<m;i++){scanf("%d%d",&x,&y);if(!p.count(y) || p[y].size()<x) printf("0\n");else printf("%d\n",p[y][x-1]);}}return 0;}
- UVA - 11991 Easy Problem from Rujia Liu?
- uva - 11991 - Easy Problem from Rujia Liu?
- uva 11991 Easy Problem from Rujia Liu?
- uva 11991 - Easy Problem from Rujia Liu?
- Uva-11991-Easy Problem from Rujia Liu?
- Uva 11991 - Easy Problem from Rujia Liu?
- UVA 11991 Easy Problem from Rujia Liu?
- UVA 11991 Easy Problem from Rujia Liu?
- uva 11991 Easy Problem from Rujia Liu?
- UVA 11991 Easy Problem from Rujia Liu?
- UVA 11991 Easy Problem from Rujia Liu?
- uva 11991 - Easy Problem from Rujia Liu?
- UVa:11991 Easy Problem from Rujia Liu?
- UVA - 11991 Easy Problem from Rujia Liu?
- UVA 11991 Easy Problem from Rujia Liu?
- UVa 11991 - Easy Problem from Rujia Liu?
- UVA 11991 Easy Problem from Rujia Liu?
- UVa 11991 Easy Problem from Rujia Liu?
- Android Matrix理论与使用详解
- 对treeMap的value 排序
- mime type与content type
- 拓展--求四个最大公约数
- 基于遗传算法和粒子群算法的混合算法实现小老鼠找奶酪问题
- uva 11991 - Easy Problem from Rujia Liu?
- SEO必须搞懂这几个问题
- 采用标准工具备份与恢复数据
- Ext.Net Status text: transaction aborted
- poll2
- Android使用adb指令在虚拟机中安装、卸载apk程序
- Error:No suitable device found: no device found for connection "System eth1" .
- Android Matrix理论与使用详解
- 程序员你应该懂得谦虚