Pagini recente » Cod sursa (job #1263729) | Cod sursa (job #2406101) | Cod sursa (job #1772729) | Cod sursa (job #1597355) | Cod sursa (job #1706889)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,v[100001],i,cer,x;
int cer0(int x)
{
int st=1,dr=n,poz=-1,mj;
while(st<=dr)
{
mj=(st+dr)/2;
if(v[mj]==x)
{
poz=mj;
st=mj+1;
}
else {
if(x<v[mj]) dr=mj-1;
else st=mj+1;
}
}
return poz;
}
int cer1(int x)
{
int st=1,dr=n,poz=-1,mj;
while(st<=dr)
{
mj=(st+dr)/2;
if(v[mj]<=x)
{
poz=mj;
st=mj+1;
}
else {if(x<v[mj]) dr=mj-1;
else st=mj+1;
}}
return poz;
}
int cer2(int x)
{
int st=1,dr=n,poz=-1,mj;
while(st<=dr)
{
mj=(st+dr)/2;
if(v[mj]>=x)
{
poz=mj;
dr=mj-1;
}
else{
if(x>v[mj]) st=mj+1;
else dr=mj-1;
}
}
return poz;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>cer>>x;
if(cer==0) fout<<cer0(x)<<'\n';
if(cer==1) fout<<cer1(x)<<'\n';
if(cer==2) fout<<cer2(x)<<'\n';
}
return 0;
}