Pagini recente » Cod sursa (job #392741) | Cod sursa (job #2522417) | Cod sursa (job #686971) | Cod sursa (job #2749514) | Cod sursa (job #3169991)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
/*int cb0(int st, int dr, int n)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(n>=a[mij])
st=mij+1;
else dr=mij-1;
}
if(a[dr]==n) return dr;
return -1;
}*/
/*int cb1(int st, int dr, int n)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(n>=a[mij])
st=mij+1;
else dr=mij;
}
return dr;
}*/
/*int cb2(int st, int dr, int n)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(n>a[mij])
st=mij+1;
else dr=mij-1;
}
return st;
}*/
int main()
{
int m,n,i,pb,x,st,dr,mij,a[100001];
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>pb>>x;
if(pb==0)
{
int st=1, dr=n, mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x>=a[mij])
st=mij+1;
else dr=mij-1;
}
if(a[dr]==x) fout<<dr<<"\n";
else fout<<-1<<"\n";
}
if(pb==1)
{
int st=1, dr=n, mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x>=a[mij])
st=mij+1;
else dr=mij;
}
fout<<dr<<"\n";
}
if(pb==2)
{
int st=1, dr=n, mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x>a[mij])
st=mij+1;
else dr=mij-1;
}
fout<<st<<"\n";
}
}
return 0;
}