Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int tab[1000009];
- int wb (int p, int k, int sz){
- if (p>k) return -1;
- int sr=(p+k)/2;
- if (tab[sr]==sz) return sr;
- if (sz<tab[sr]) return wb(p, sr-1, sz);
- else return wb(sr+1, k, sz);
- }
- int main()
- {
- int a,b,c,n;
- cin>>n;
- for (int i=0; i<n; i++){cin>>tab[i];}
- cin>>a;
- for (int i=0; i<n; i++) {
- cin>>tab[b];
- c=wb(0,n-1,tab [b])+1;
- if (c==-1) cout<<"b ";
- else cout<<c<<" ";}
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement