Pagini recente » Cod sursa (job #1317564) | Cod sursa (job #2537589) | Cod sursa (job #2631369) | Cod sursa (job #115569) | Cod sursa (job #283065)
Cod sursa(job #283065)
#include<fstream.h>
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,a[100001],i,m,x,y;
void cit()
{int j;
f>>n;
for(j=1;j<=n;j++)
f>>a[j];
f>>m;
}
int caut0(int p)
{int in=1,sf=n,ma,ga=0;
while(in<=sf&&!ga)
{ma=(in+sf)/2;
if(p<a[ma])
sf=ma-1;
else
if(p>a[ma])
in=ma+1;
else
ga=1;
}
if(!ga)
return -1;
else
while(a[ma]==x)
ma++;
return ma-1;
}
int caut1(int p)
{int in=1,sf=n,ma,ga=0;
while(in<=sf&&!ga)
{ma=(in+sf)/2;
if(p<a[ma])
sf=ma-1;
else
if(p>a[ma])
in=ma+1;
else
ga=1;
}
if(!ga)
return ma-1;
else
while(a[ma]==p)
ma--;
return ma;
}
int caut2(int p)
{int in=1,sf=n,ma,ga=0;
while(in<=sf&&!ga)
{ma=(in+sf)/2;
if(p<a[ma])
sf=ma-1;
else
if(p>a[ma])
in=ma+1;
else
ga=1;
}
if(!ga)
return ma;
else
while(a[ma]==p)
ma++;
return ma;
}
int main()
{
cit();
for(i=1;i<=m;i++)
{f>>y>>x;
if(!y)
g<<caut0(x)<<'\n';
if(y==1)
g<<caut1(x)<<'\n';
if(y==2)
g<<caut2(x)<<'\n';
}
return 0;
}