Pagini recente » Cod sursa (job #1677293) | Cod sursa (job #2753173) | Cod sursa (job #2377300) | Cod sursa (job #211152) | Cod sursa (job #274973)
Cod sursa(job #274973)
#include <stdio.h>
#define MAX 100001
int a[MAX], n;
int q(int x)
{
int s=1, d=n;
while(s<d)
if(a[(s+d)/2]>x) s=(s+d)/2+1;
else if(a[(s+d)/2]<x) d=(s+d)/2-1;
else return (s+d)/2;
return -1;
}
/*int q1(int x)
{
return 0;
}*/
int main()
{
int i, m, op, el;
FILE *fi=fopen("cautbin.in", "r"), *fo=fopen("cautbin.out", "w");
fscanf(fi, "%d", &n);
for(i=1; i<=n; i++)
fscanf(fi, "%d", &a[i]);
fscanf(fi, "%d", &m);
for(i=1; i<=m; i++)
{
fscanf(fi, "%d%d", &op, &el);
if(op==0)
{
fprintf(fo, "%d", q(el));
}
else
if(op==2)
{
fprintf(fo, "%d", q(el)-1);
}
else
{
fprintf(fo, "%d", q(el)+1);
}
}
fclose(fi);
fclose(fo);
return 0;
}