| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 128343 | 陈道宁 | 折半查找法 | C++ | Accepted | 100 | 2 MS | 332 KB | 324 | 2024-01-25 16:58:32 |
#include<bits/stdc++.h> using namespace std; long long n,m,a[10010]; int main(){ cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; cin>>m; int l=1,r=n; while(l<=r){ int mid=l+r>>1; if(a[mid]==m){ cout<<mid; return 0; } if(a[mid]>m) r=mid-1; if(a[mid]<m) l=mid+1; } cout<<"-1"; return 0; }