Pagini recente » Cod sursa (job #1834862) | Cod sursa (job #1595135) | Cod sursa (job #3186325) | Cod sursa (job #1139197) | Cod sursa (job #513882)
Cod sursa(job #513882)
#include <stdio.h>
FILE *f,*g;
long long n,m,v[10001];
int search(int t,int a)
{int u,p,mij,poz=-1;
p=1; u=n;
if(t==0)
{while(p<=u)
{mij=(p+u)/2;
if(v[mij]==a)
{poz=mij;
p=mij+1;
}
else if(v[mij]>a)
u=mij-1;
else if(v[mij]<a)
p=mij+1;
}
}
else if(t==1)
{while(p<=u)
{mij=(p+u)/2;
if(v[mij]<=a)
{poz=mij;
p=mij+1;
}
else if(v[mij]>a)
u=mij-1;
}
}
else if(t==2)
{while(p<=u)
{mij=(p+u)/2;
if(v[mij]>=a)
{poz=mij;
u=mij-1;
}
else if(v[mij]<a)
p=mij+1;
}
}
return poz;
}
int main()
{int i,j;
f=fopen("cautbin.in","r");
g=fopen("cautbin.out","w");
fscanf(f,"%lld",&n);
for(i=1;i<=n;i++)
fscanf(f,"%lld",&v[i]);
fscanf(f,"%lld",&m);
long long q;
short t;
long long r;
for(i=1;i<=m;i++)
{fscanf(f,"%d %lld",&t,&q);
r=search(t,q);
fprintf(g,"%lld\n",r);
}
fclose(f);
fclose(g);
return 0;
}