大理石在哪
来源:互联网 发布:三维地质建模软件 编辑:程序博客网 时间:2024/06/10 07:51
Raju and Meena love to play with Marbles. They have got a lot of
marbles with numbers written on them. At the beginning, Raju would
place the marbles one after another in ascending order of the numbers
written on them. Then Meena would ask Raju to find the first marble
with a certain number. She would count 1...2...3. Raju gets one point
for correct answer, and Meena gets the point if Raju fails. After some
fixed number of trials the game ends and the player with maximum
points wins. Today it’s your chance to play as Raju. Being the smart
kid, you’d be taking the favor of a computer. But don’t underestimate
Meena, she had written a program to keep track how much time you’re
taking to give all the answers. So now you have to write a program,
which will help you in your role as Raju.
Input
There can be multiple test cases. Total no of test cases is less than 65.
Each test case consists beginswith 2 integers: N the number of marbles
and Q the number of queries Mina would make. The nextN lines would contain
the numbers written on the N marbles. These marble numbers will not come
in any particular order. Following Q lines will have Q queries. Be assured,
none of the input numbersare greater than 10000 and none of them are negative.
Input is terminated by a test case where N = 0 and Q = 0.
Output
For each test case output the serial number of the case.
For each of the queries, print one line of output. The format of this line will
depend upon whetheror not the query number is written upon any of the marbles.
The two different formats are described below:
? ‘x found at y’, if the firstmarble with number x was found at position y.
Positions are numbered1, 2, . . . , N.
? ‘x not found’, if the marble with number x is not present.
Look at the output for sample input for details.
Sample Input
4 1
2
3
5
1
5
5 2
1
3
3
3
1
2
3
0 0
Sample Output
CASE# 1:
5 found at 4
CASE# 2:
2 not found
3 found at 3
#include<iostream>#include<algorithm>using namespace std;const int maxn = 10000;int main(){int n, q, x, a[maxn], kase = 0;while (scanf("%d%d", &n, &q) == 2 && n!=0&&q!=0){printf("CASE# %d:\n", ++kase);for (int i = 0; i < n; i++)scanf("%d", &a[i]);sort(a, a + n);while (q--){scanf("%d", &x);int p= lower_bound(a, a + n, x) - a;//再已排序数组a中寻找xif (a[p] == x) printf("%d found at %d\n", x, p + 1);else printf("%d not found\n", x);}}return 0;}
题解:有n个大理石,每个大理石上写了一个非负整数。首先把各数从小到大排序,然后回答Q个问题。
每个问题问是否有一个大理石写着某个整数x,如果是,还要回答哪个大理石上写着x。排序后大理石
从做到右编号为1-n
0 0
- 大理石在哪
- 大理石在哪
- UVa 10474 大理石在哪?
- UVa 10474 大理石在哪?
- UVaOJ 10474 大理石在哪?
- 紫书章五 大理石在哪 UVA 10474(stl排序查找)
- 大理石在哪(Where is the Marble?, uva 10474)
- Uva 10474(lower_bound()的使用) 大理石在哪
- 大理石
- UVA 10474 大理石在哪里
- uvaoj-12474:大理石在哪里
- 大理石在哪?(Where is the Marble?, UVa 10474)代码
- 例题5-1 UVA 10474 Where is the Marble?大理石在哪?
- 算法之路二:刘汝佳算法竞赛入门经典:STL排序与检索 大理石在哪 UVA10474
- 大理石刻字
- 大理石在哪儿
- 【POJ1014】【TYVJ1194】划分大理石
- UVa 10474 大理石在哪儿
- java第一个小代码 Hello world !
- 深入浅出RxJava(一:基础篇)
- mac配置环境变量
- CUDA学习(四)流沙上建高楼
- 机器学习第5周!
- 大理石在哪
- Runnable和Thread
- mybatis oracle 序列自增与 uuid生成
- git学习
- 【算法之家】——希尔排序
- 渲染世界的Opengl<5>基础渲染代码分析
- WebStrom恢复误删的工程
- Dynamic DataSource Routing
- jQuery+PHP上传裁剪图片