Pagini recente » Cod sursa (job #1010518) | Cod sursa (job #2345601) | Cod sursa (job #3268496) | Cod sursa (job #921670) | Cod sursa (job #2151210)
#include <fstream>
//#include <iostream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,i,v[100001],k,st,dr,mij,a,b,ok=0;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>k;
for(i=1; i<=k; i++)
{
fin>>a>>b;
if(a==0)
{
st=1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=b)
st=mij+1;
else
dr=mij-1;
}
if(v[dr]!=b)
fout<<-1<<'\n';
else
fout<<dr<<'\n';
}
if(a==1)
{
st=1;dr=n;ok=0;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>b)
dr=mij-1;
else
st=mij+1;
}
fout<<dr<<'\n';
}
if(a==2)
{
st=1;dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<b)
st=mij+1;
else
dr=mij-1;
}
fout<<st<<'\n';
}
}
return 0;
}