超级会员免费看
这是一个数据结构问题，要求在数组中找到特定数值的第k次从左到右的出现位置。输入包含多个测试用例，每个用例给出数组长度n和查询数m，接着是n个正整数，然后是m个查询，每个查询包含k和v。输出是对应查询的结果，如果找不到则输出0。
Easy Problem from Rujia Liu?
来源：UVA
标签：数据结构
参考资料：
相似题目：
题目
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.
输入
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
订阅专栏 解锁全文
扫一扫
199
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
