1152: 二分搜索
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 1493 Solved: 545
Submit Status Web Board
Description
在有序序列中查找某一元素x。
Input
首先输入一个正整数n(n<=100000),表示该序列有n个整数,然后按从小到大的顺序输入n个整数;
接着是一个正整数m,表示有m次查找;
最后是m个整数,表示m个要查找的整数x。
Output
对于每一次查找,有一行输出。若序列中存在要查找的元素x,则输出元素x在序列中的序号(序号从0开始);若序列中不存在要查找的元素x,则输出"Not found!"。
Sample Input
51 3 5 7 9 11-112345678910
Sample Output
Not found!0Not found!1Not found!2Not found!3Not found!4Not found!
#include<stdio.h>
int a[100000 +10];
int fi(int a[],int m,int x)
{
int low = 0;
int high = m-1;
while(low <= high){
int mid=(low + high)/2;
int y=a[mid];
if(y < x)
low = mid +1;
else if(y>x)
high = mid -1;
else
return mid;
}
return -1;
}
int main()
{
int n;
scanf("%d",&n);
for(int i = 0;i < n;i ++){
scanf("%d",&a[i]);
}
int t;
scanf("%d",&t);
while(t--){
int x;
scanf("%d",&x);
int k = fi(a,n,x);
if(k==-1){
printf("Not found!\n"); continue;
}
else{
printf("%d\n",k); continue;
}
}
return 0;
}
#include<stdio.h>
int a[100000 +10];
int fi(int a[],int m,int x)
{
int low = 0;
int high = m-1;
while(low <= high){
int mid=(low + high)/2;
int y=a[mid];
if(y < x)
low = mid +1;
else if(y>x)
high = mid -1;
else
return mid;
}
return -1;
}
int main()
{
int n;
scanf("%d",&n);
for(int i = 0;i < n;i ++){
scanf("%d",&a[i]);
}
int t;
scanf("%d",&t);
while(t--){
int x;
scanf("%d",&x);
int k = fi(a,n,x);
if(k==-1){
printf("Not found!\n"); continue;
}
else{
printf("%d\n",k); continue;
}
}
return 0;
}