Pagini recente » Cod sursa (job #2482234) | Cod sursa (job #179248) | Cod sursa (job #2085086) | Cod sursa (job #1804538) | Cod sursa (job #2445670)
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n,v[100005],m,p,x,val,y,pmax=-1,ok;
int bs0(int val)
{
int st=0,dr=n,mij,sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==val)
{
sol=mij;
st=mij+1;
}
if(v[mij]>val)
dr=mij-1;
else
st=mij+1;
}
if(sol!=-1)
return -1;
}
int bs1(int val)
{
int st=0,dr=n,mij,sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=val)
{
sol=mij;
st=mij+1;
}
else
dr=mij-1;
}
return sol;
}
int bs2(int val)
{
int st=0,dr=n,mij,sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=val)
{
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
return sol;
}
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
cin>>m;
for(int i=1; i<=m; i++)
{
cin>>x>>y;
if(x==0)
cout<<bs0(y)<<'\n';
else if(x==1)
cout<<bs1(y)<<'\n';
else
cout<<bs2(y)<<'\n';
}
return 0;
}