Pagini recente » Cod sursa (job #971104) | Cod sursa (job #2019589) | Cod sursa (job #262159) | Cod sursa (job #1290767) | Cod sursa (job #2482421)
#include <bits/stdc++.h>
using namespace std;
int n,m,nr,a[100010];
int cb0(int x){
int st = 1, dr = n;
int mid;
while(st <= dr){
mid = (st+dr)/2;
if(a[mid] <= x)
st = mid+1;
else
dr = mid - 1;
}
if(a[dr] == x)
return dr;
return -1;
}
int cb1(int x){
int st = 1, dr = n;
int mid;
while(st <= dr){
mid = (st + dr)/2;
if(a[mid] <= x)
st = mid +1;
else
dr = mid - 1;
}
return dr;
}
int cb2(int x){
int st = 1, dr = n;
int mid;
while(st <= dr){
mid = (st + dr)/2;
if(a[mid] >= x)
dr = mid -1;
else
st = mid + 1;
// cout<<st<<' '<<dr<<'\n';
}
return st;
}
int main()
{
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
cin>>m;
for(;m;m--)
{
int x;
cin>>nr>>x;
if(!nr)
{
cout<<cb0(x)<<'\n';
}
if(nr==1)
{
cout<<cb1(x)<<'\n';
}
if(nr==2)
{
cout<<cb2(x)<<'\n';
}
}
return 0;
}