Pagini recente » Cod sursa (job #1732380) | Cod sursa (job #2451238) | Cod sursa (job #3209953) | Cod sursa (job #2565253) | Cod sursa (job #2400433)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,m,y,x,i,a[100001];
int zero(int nr)
{
int st=1,dr=n,mij;
while (st<dr)
{
mij=(st+dr+1)/2;
if (a[mij]<=nr)
st=mij;
else
dr=mij-1;
}
if (a[st]!=nr)
return -1;
return st;
}
int unu(int nr)
{
int st=1,dr=n,mij;
while (st<dr)
{
mij=(st+dr+1)/2;
if (a[mij]<=nr)
st=mij;
else
dr=mij-1;
}
return st;
}
int doi(int nr)
{
int st=1,dr=n,mij;
while (st<dr)
{
mij=(st+dr)/2;
if (a[mij]<nr)
st=mij+1;
else
dr=mij;
}
return dr;
}
int main()
{
in>>n;
for (i=1; i<=n; ++i)
{
in>>a[i];
}
in>>m;
for (i=1; i<=m; ++i)
{
in>>x>>y;
if (x==0)
out<<zero(y)<<"\n";
if (x==1)
out<<unu(y)<<"\n";
if (x==2)
out<<doi(y)<<"\n";
}
}