Pagini recente » Cod sursa (job #2649932) | Cod sursa (job #2625898) | Cod sursa (job #1670580) | Cod sursa (job #2981153) | Cod sursa (job #1892980)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
long n,m,x,i,j,v[100004],c,p1,p2,mij;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>c>>x;
p1=1;
p2=n;
if(c==0)
{
while(p1<=p2)
{
mij=p1+(p2-p1)/2;
if(x>=v[mij])
{
p1=mij+1;
}
else
{
p2=mij-1;
}
}
if(v[p2]==x)
{
fout<<p2<<"\n";
}
else
{
fout<<-1<<"\n";
}
}
if(c==1)
{
while(p1<=p2)
{
mij=p1+(p2-p1)/2;
if(x>=v[mij])
{
p1=mij+1;
}
else
{
p2=mij-1;
}
}
fout<<p2<<"\n";
}
if(c==2)
{
while(p1<=p2)
{
mij=p1+(p2-p1)/2;
if(x>v[mij])
{
p1=mij+1;
}
else
{
p2=mij-1;
}
}
fout<<p1<<"\n";
}
}
fin.close();
fout.close();
return 0;
}