Pagini recente » Statistici Ionescu Maria (mariaionescu2006) | Cod sursa (job #3293476) | dedicatie | Cod sursa (job #1454644) | Cod sursa (job #430837)
Cod sursa(job #430837)
#include<cstdio>
using namespace std;
FILE *f=fopen("cautbin.in","r"), *g=fopen("cautbin.out","w");
int a[100001];
int bin0(int x, int y, int k)
{
int m;
while(x<=y)
{
m=(x+y)/2;
if(a[m]>=k)
x=m+1;
else y=m-1;
}
m=(x+y)/2;
if(a[m]>k) m--;
if(a[m]==k) return m;
return -1;
}
int bin1(int x, int y, int k)
{
int m;
while(x<y)
{
m=(x+y)/2;
if(a[m]>=k)
x=m+1;
else y=m;
}
m=(x+y)/2;
if(a[m]>k) m--;
return m;
}
int bin2(int x, int y, int k)
{
int m;
while(x<y)
{
m=(x+y)/2;
if(a[m]<k)
x=m+1;
else y=m;
}
m=(x+y)/2;
if(a[m]<k) m++;
return m;
}
int main()
{
int n,m,i,intr,x;
fscanf(f,"%d",&n);
for(i=0;i<n;i++)
fscanf(f,"%d",&a[i]);
fscanf(f,"%d",&m);
while(m --)
{
fscanf(f,"%d %d",&intr,&x);
if(intr==0) fprintf(g,"%d\n",bin0(1,n,x)+1);
else if(intr==1) fprintf(g,"%d\n",bin1(1,n,x)-1);
else if(intr==2) fprintf(g,"%d\n",bin2(1,n,x)+1);
}
return 0;
}