Pagini recente » Cod sursa (job #298275) | Cod sursa (job #1534270) | Cod sursa (job #916303) | Cod sursa (job #886461) | Cod sursa (job #1006254)
#include <fstream>
using namespace std;
int m,n,v[100005],q,nr,i,dr,st,mid;
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>q;f>>nr;
if(q==0)
{
st=1;dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]>nr)
dr=mid-1;
else
st=mid+1;
}
if(v[dr]==nr)
g<<dr<<"\n";
else
g<<"-1"<<"\n";
}
else
if(q==1)
{
st=1;dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]>nr)
dr=mid-1;
else
st=mid+1;
}
g<<dr<<"\n";
}
else
if(q==2)
{
st=1;dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]<nr)
st=mid+1;
else
dr=mid-1;
}
g<<st<<"\n";
}
}
f.close();g.close();
return 0;
}