map,队列
来源:互联网 发布:大学生网络安全教育ppt 编辑:程序博客网 时间:2024/05/23 22:09
Problem E
Easy Problem from Rujia Liu?
Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasionally sets easy problem (for example, 'the Coco-Cola Store' in UVa OJ), to encourage more people to solve his problems :D
Given an array, your task is to find the k-th occurrence (from left to right) of an integer v. To make the problem more difficult (and interesting!), you'll have to answer m such queries.
Input
There are several test cases. The first line of each test case contains two integers n, m(1<=n,m<=100,000), the number of elements in the array, and the number of queries. The next line contains n positive integers not larger than 1,000,000. Each of the following m lines contains two integer k and v (1<=k<=n, 1<=v<=1,000,000). The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.
Output
For each query, print the 1-based location of the occurrence. If there is no such element, output 0 instead.
Sample Input
8 41 3 2 2 4 3 2 11 32 43 24 2
Output for the Sample Input
2070
#include<iostream>#include<ctime>#include<algorithm>#include<string>#include<queue>#include<map>using namespace std;map<int, vector<int> >a;//最后两个不要连着写会误认为>>int main(){freopen("in.txt", "r", stdin);int n, m, x, y;while (scanf("%d%d", &n, &m) == 2){a.clear();for (int i = 0; i < n; i++){scanf("%d", &x);if (!a.count(x))//是否有x这个,有返回1a[x] = vector<int>();a[x].push_back(i + 1);}while (m--){scanf("%d%d", &x, &y);if (!a.count(y) || a[y].size() < x)printf("0\n");elseprintf("%d\n", a[y][x - 1]);}}}
- map,队列
- map应用-双向队列
- Uva540 队列与map
- STL中map与优先级队列
- Windows Message Queue(优先级队列+map)
- Codeforces 15D Map 单调队列+构造
- CodeForces 15D Map 单调队列优化
- Java_SE05-Comparable,Map接口,队列,栈
- Set、Map、Tuple、队列操作实战
- 标准容器map的使用(创建优先级队列)
- hrbust 1176 小陈老师、雪人【map+优先队列】
- hdu 2112 HDU Today 优先队列优化的Dijkstra+map
- NDK-CPP语言-queue队列+stack栈+list+set+map
- 【STL】poj2259 Team Queue (队列+map的应用)
- 第四节 Set、Map、Tuple、队列操作实战
- Keep In Line(BNUOJ 队列 string,map应用)
- HDU 6015 Skip the Class 优先队列 map的使用
- UVA-136 Ugly Numbers (map容器+优先队列)
- 眉目传情之匠心独运的kfifo
- HLJUOJ1104(贪心)
- FCKeditor使用方法技术详解
- C# 读写文本文件乱码解决方案
- ACM数学
- map,队列
- Socket请求和Http请求的各自特点、区别及适用场景
- C++分别用指针和引用实现交换函数
- Oracle数据库操作大全(十三)——pl/sql编程(存储过程、函数、触发器)
- linux下的cc和gcc
- oracle 存储过程,触发器遍历游标的三种方法
- 手工添加jar到本地maven库
- 程序员的第一门语言 英语
- linaro-ubuntu 系统启动配置和Zedboard的VNC配置