Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int a[100005],n,q,x;
- int BinarySearch(int a[],int x,int l,int r){
- // cout <<"l va r "<<l << " " <<r<<"\n";
- if(l==r){
- if(a[l]==x)
- return l-1;
- else return -1;
- }
- int mid=(l+r)/2;
- if(a[mid]<x) return BinarySearch(a,x,mid+1,r);
- if(a[mid]>=x){
- return BinarySearch(a,x,l,mid);
- }
- }
- int main(){
- cin>>n>>q;
- for(int i=1;i<=n;i++)
- cin>>a[i];
- for(int i=1;i<=q;i++){
- cin>>x;
- cout<< BinarySearch(a,x,1,n)<<'\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement