Pagini recente » Cod sursa (job #2436621) | Cod sursa (job #2223728) | Cod sursa (job #2001115) | Cod sursa (job #2177550) | Cod sursa (job #2063846)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int x[100001];
int main()
{
int n,m,i,j,k,y;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>k>>y;
int mij;
if(k==0)
{
int st=1, dr=n;
while(st<=dr)
{
mij=(dr+st)/2;
// g<<mij<<" "<<st<<" "<<dr<<"\n";
if(x[mij]<=y)
st=mij+1;
else if(x[mij]>y)
dr=mij-1;
// else if(x[mij]==y)
// break;
}
mij=(st+dr)/2;
// g<<mij;
if(x[mij]==y)
g<<mij<<"\n";
else
g<<"-1";
}
if(k==1)
{
int st=1, dr=n;
while(st<dr)
{
int mij=(dr+st)/2;
if(x[mij]>y)
dr=mij;
if(x[mij]<=y)
st=mij+1;
}
mij=(dr+st)/2;
if(x[mij]>y)
mij--;
g<<mij<<"\n";
}
if(k==2)
{
int st=1, dr=n;
while(st<dr)
{
int mij=(dr+st)/2;
if(x[mij]>=y)
dr=mij;
if(x[mij]<y)
st=mij+1;
}
mij=(dr+st)/2;
if(x[mij]<y)
mij++;
g<<mij<<"\n";
}
}
return 0;
}