Pagini recente » Cod sursa (job #916914) | Cod sursa (job #1549693) | Cod sursa (job #1713197) | Cod sursa (job #2738993) | Cod sursa (job #484224)
Cod sursa(job #484224)
#include <stdio.h>
int i,n,x,v[100000],r,l=1,a,b,y,t[100000],z[100000],j;
int cb1(int x)
{
int m=l+(l+r)/2;
while (v[m]!=x && l<r)
{
if (v[m]<x) l=m+1;
else r=m-1;
m=l+(l+r)/2;
}
if (v[m]==x) return m;
else return -1;
}
int cb2(int x)
{
int m=l+(l+r)/2;
while (v[m]!=x && l<r)
{
if (v[m]<x) l=m+1;
else r=m-1;
m=l+(l+r)/2;
}
return m;
}
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
r=n;
for (i=1; i<=n; ++i) scanf("%d",&v[i]);
scanf("%d",&y);
for (i=1; i<=y; ++i) scanf("%d%d",&t[i],&z[i]);
for (i=1; i<=y; ++i)
if (t[i]==0)
{
x=z[i];
printf("%d\n",cb1(x));
}
else if (t[i]==1)
{
x=z[i];
printf("%d\n",cb2(x));
}
else
{
x=z[i];
a=cb1(x);
b=cb2(x);
if (b!=a) printf ("%d",b);
else for (j=1; j<=n; ++j)
if (v[j]==x)
{
printf("%d",j);
break;
}
}
return 0;
}