Pagini recente » Cod sursa (job #434444) | Cod sursa (job #1444961) | Cod sursa (job #2855145) | Istoria paginii runda/lame.contest | Cod sursa (job #2704544)
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,v[100001],m,cod,x;
int main()
{
fin >> n;
for(int i=1;i<=n;i++)
fin >> v[i];
fin >> m;
for(int i=1;i<=m;i++)
{
fin >> cod >> x;
int st=1,dr=n;
if(cod==0)
{
while(st<=dr)
{
int mij=(st+dr)/2;
if(x>=v[mij]) st=mij+1;
else dr=mij-1;
}
if(v[st-1]==x)
fout << st-1 << "\n";
else fout << "-1\n";
}
else if(cod==1)
{
while(st<=dr)
{
int mij=(st+dr)/2;
if(x>=v[mij]) st=mij+1;
else dr=mij-1;
}
fout << st-1 << "\n";
}
else
{
while(st<=dr)
{
int mij=(st+dr)/2;
if(x<=v[mij]) dr=mij-1;
else st=mij+1;
}
fout << dr+1 << "\n";
}
}
return 0;
}