Pagini recente » Cod sursa (job #1069536) | Diferente pentru utilizator/borodi intre reviziile 1 si 2 | Cod sursa (job #1399939) | Cod sursa (job #1000505) | Cod sursa (job #2681198)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int V[100001];
int main()
{
int n, m, st, dr, q, val, med, ans;
in>>n;
for(int i=1;i<=n;i++)
in>>V[i];
in>>m;
for(int i=1;i<=m;i++)
{
ans=-1;
in>>q>>val;
st=0;
dr=n-1;
if(q==0)
{
while(st<=dr)
{
med=(st+dr)/2;
if(V[med]<=val)
{
ans=med;
st=med+1;
}
else
dr=med-1;
}
}
if(q==1)
{
while(st<=dr)
{
med=(st+dr)/2;
if(V[med]<=val)
{
ans=med;
st=med+1;
}
else
dr=med-1;
}
}
if(q==2)
{
while(st<=dr)
{
med=(st+dr)/2;
if(V[med]>=val)
{
ans=med;
dr=med-1;
}
else
st=med+1;
}
}
out<<ans<<'\n';
}
return 0;
}