Pagini recente » Cod sursa (job #233560) | Cod sursa (job #142463) | Cod sursa (job #468868) | Cod sursa (job #2025201) | Cod sursa (job #1412077)
#include <cstdio>
int n,i,j,p,m,tip,x,l,a[100005];
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(j=1;j<=n;j<<=1);
scanf("%d",&m);
for(l=1;l<=m;l++)
{
scanf("%d%d",&tip,&x);
if(tip==0)
{
p=0;
for(i=j;i>=1;i>>=1)
{
if(p+i<=n&&a[p+i]<=x)p=p+i;
}
if(a[p]==x)printf("%d\n",p);
else printf("-1\n");
}
if(tip==1)
{
p=0;
for(i=j;i>=1;i>>=1)
{
if(p+i<=n&&a[p+i]<=x)p=p+i;
}
printf("%d\n",p);
}
if(tip==2)
{
p=n;
for(i=j;i>=1;i>>=1)
{
if(p-i>=1&&a[p-i]>=x)p=p-i;
}
printf("%d\n",p);
}
}
return 0;
}