Pagini recente » Cod sursa (job #2900874) | Cod sursa (job #1105115) | Cod sursa (job #661729) | Cod sursa (job #2120933) | Cod sursa (job #804226)
Cod sursa(job #804226)
#include <cstdio>
int v[100005],n;
using namespace std;
int caut0(int x)
{
int i=0,pas=1<<16;
while(pas!=0)
{
if(i+pas<=n&&v[i+pas]<=x)
i+=pas;
pas /= 2;
}
if(v[i]==x)return i;
return -1;
}
int caut1(int x)
{
int i=0,pas=1<<16;
while(pas!=0)
{
if(i+pas<=n&&v[i+pas]<=x)
i+=pas;
pas /= 2;
}
return i;
}
int caut2(int x)
{
int i=0,pas=1<<16;
while(pas!=0)
{
if(i+pas<=n&&v[i+pas]<x)
i+=pas;
pas /= 2;
}
return i+1;
}
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
int x,y,m,i;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
if(x==0)printf("%d\n",caut0(y));
else
if(x==1)printf("%d\n",caut1(y));
else
printf("%d\n",caut2(y));
}
}