经典第五章例5.1 UVa 10474 Where is the Marble?(排序与检索)
2016-08-13 14:30
567 查看
http://7xjob4.com1.z0.glb.clouddn.com/53e5c6d66221525b0c18113b513fc3fb
很简单的排序和检索。
下面是AC代码:
很简单的排序和检索。
下面是AC代码:
#include<cstdio> #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) { 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;//lower_bound的作用是查找“大于或等于x”的第一个位置 if(a[p]==x) { printf("%d found at %d\n",x,p+1); } else { printf("%d not found\n",x); } } } return 0; }
相关文章推荐
- Where is the Marble? Uva_10474 ——最为简单的排序和检索
- UVa 10474 Where is the Marble? 【STL】【排序与检索-sort和lower_bound】
- Uva 10474 Where is the Marble?(排序与检索)
- 排序与检索【UVa10474】Where is the Marble?
- UVa 10474 - Where is the Marble?【排序和检索】
- UVA 10474 (暑假-排序、检索 -C - Where is the Marble?)
- uva 10474 - Where is the Marble?(排序,二分搜索)
- 10474 - 大理石在哪儿Where is the Marble?(排序+检索)
- 算法竞赛入门经典第五章例题5-1 Where is the Marble? UVA - 10474
- 排序检索-10474 - Where is the Marble?
- UVA10474-5.1-Where is the Marble?
- uva 10474 Where is the Marble?(排序)
- UVA.10474 Where is the Marble ( 排序 二分查找 )
- UVA 10474-Where is the Marble?(排序查找在数字在新序列中的位置)
- UVA 10474 - Where is the Marble?
- Uva 10474 Where is the Marble?
- Uva 10474 - Where is the Marble?(水题)
- UVa 10474 - Where is the Marble
- UVA 10474 Where is the Marble?
- UVa 10474 - Where is the Marble?