Pagini recente » Cod sursa (job #2683325) | Cod sursa (job #1058656) | Istoria paginii runda/vendetta_dc5/clasament | Cod sursa (job #1886467) | Cod sursa (job #1247129)
#include <cstdio>
int log,n;
using namespace std;
int v[100001];
int cb1(int x)
{
int i=0,pas;
pas=1<<17;
while(pas!=0)
{
if(i+pas<=n)
{
if(v[i+pas]<=x)
i+=pas;
}
pas>>=1;
}
if (v[i]==x) return i;
else return -1;
}
int cb2(int x)
{
int i=0,pas;
pas=1<<17;
while(pas!=0)
{
if(i+pas<=n)
{
if(v[i+pas]<=x)
i+=pas;
}
pas>>=1;
}
return i;
}
int cb3(int x)
{
int i=0,pas;
pas=1<<17;
while(pas!=0)
{
if(i+pas<=n)
{
if(v[i+pas]<x)
i+=pas;
}
pas>>=1;
}
return i+1;
}
int main()
{
FILE *fin,*fout;
fin=fopen("cautbin.in","r");
fout=fopen("cautbin.out","w");
int i,j,m,a,x;
fscanf(fin,"%d",&n);
for(i=1; i<=n; i++)
fscanf(fin,"%d",&v[i]);
// log=1;
/* while(2*log<=n)
{
log*=2;
}*/
fscanf(fin,"%d",&m);
for(i=1; i<=m; i++)
{
fscanf(fin,"%d%d",&a,&x);
if (a==0) fprintf(fout,"%d\n",cb1(x));
if (a==1) fprintf(fout,"%d\n",cb2(x));
if (a==2) fprintf(fout,"%d\n",cb3(x));
}
return 0;
}