本文主要是介绍UVA 10474 --- Where is the Marble? 二分查找，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Description
Where is the Marble?
| Where is the Marble? |
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 begins with 2 integers: N the number of marbles and Q the number of queries Mina would make. The next N 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 numbers are 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 whether or not the query number is written upon any of the marbles. The two different formats are described below:
- `x found at y', if the first marble with number x was found at position y. Positions are numbered 1, 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
Problem-setter: Monirul Hasan Tomal, Southeast University
#include <stdio.h>
#include <string.h>
#include <algorithm>using namespace std;int s[100010];int b_find(int l,int r,int sr)
{while(l <= r){int mid = (l + r) >> 1;if(s[mid] == sr)return mid;else if(sr < s[mid])r = mid - 1;else if(sr > s[mid])l = mid + 1;}return -1;
}int main()
{int n,m,sr,c = 0,fh;while(scanf("%d%d",&n,&m),n || m){for(int i = 0;i < n;i++)scanf("%d",&s[i]);sort(s,s + n);printf("CASE# %d:\n",++c);for(int i = 0;i < m;i++){scanf("%d",&sr);if((fh = b_find(0,n - 1,sr)) != -1){while(fh > 0 && s[fh] == s[fh - 1])fh--;printf("%d found at %d\n",sr,fh + 1);}elseprintf("%d not found\n",sr);}}return 0;
}
这篇关于UVA 10474 --- Where is the Marble? 二分查找的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
