Pagini recente » Cod sursa (job #1112094) | Cod sursa (job #1702378) | Cod sursa (job #531633) | Cod sursa (job #2623584) | Cod sursa (job #2075002)
#include <cstdio>
using namespace std;
int a[100005],n,m,c,x,lg;
int c01(int lg,int c)
{
int i;
for(i=0;lg!=0;lg>>=1)
if(i+lg<=n && a[i+lg]<=x)
i+=lg;
if(a[i]!=x &&c ==0)
return -1;
return i;
}
int c2(int lg)
{
int i;
for(i=n;lg!=0;lg>>=1)
if(i-lg>0 && a[i-lg]>=x)
i-=lg;
return i;
}
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(lg=1;lg<=n;lg<<=1);
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d %d",&c,&x);
if(c<2)
{
printf("%d\n",c01(lg,c));
continue;
}
printf("%d\n",c2(lg));
}
return 0;
}