Pagini recente » Cod sursa (job #2264104) | Cod sursa (job #959106) | Cod sursa (job #446188) | Cod sursa (job #273002) | Cod sursa (job #2664920)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,v[100001],x,y,rep;
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
fin>>v[i];
fin>>rep;
for (int i=1;i<=rep;i++){
fin>>x>>y;
if (x==0){
int st=1;
int dr=n;
while (st<=dr){
long long mid=(st+dr)/2;
if (v[mid]<=y)
st=mid+1;
else
dr=mid-1;
}
if (v[dr]==y)
fout<<dr<<"\n";
else
fout<<-1<<"\n";
}
else
if (x==1){
int st=1;
int dr=n;
while (st<=dr){
long long mid=(st+dr)/2;
if (v[mid]<=y)
st=mid+1;
else
dr=mid-1;
}
fout<<dr<<"\n";
}
else{
int st=1;
int dr=n;
while (st<=dr){
long long mid=(st+dr)/2;
if (v[mid]<y)
st=mid+1;
else
dr=mid-1;
}
fout<<st<<"\n";
}
}
return 0;
}