| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 127261 | 林扬泉 | 折半查找法 | C++ | Accepted | 100 | 1 MS | 284 KB | 446 | 2024-01-25 08:30:27 |
#include<bits/stdc++.h> using namespace std; const int N=1e4+10; int n,t; int a[N]; int main(){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } scanf("%d",&t); int l=1,r=n,mid; while(l<=r){ mid=(l+r)>>1; if(a[mid]<t){ l=mid+1; } else if(a[mid]>t){ r=mid-1; } else if(a[mid]==t){ break; } } if(a[mid]!=t){ printf("-1\n"); } else{ printf("%d\n",mid); } return 0; }