Pagini recente » Cod sursa (job #125628) | rglshw_1 | Cod sursa (job #2442040) | Cod sursa (job #1040053) | Cod sursa (job #1769938)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100001],n,i,st,dr,m,a,x,mij;
int cautare0 ( int x)
{
int poz=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<x)
st=mij+1;
else
if(v[mij]>x)
dr=mij-1;
else
{
st=mij+1;
poz=mij;
}
}
return poz;
}
int cautare1(int x)
{
int poz;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
st=mij+1;
poz=mij;
}
else
if(v[mij]>x)
dr=mij-1;
}
return poz;
}
int cautare2(int x)
{
int poz;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<x)
st=mij+1;
else
if(v[mij]>=x)
{
dr=mij-1;
poz=mij;
}
}
return poz;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>a>>x;
dr=n,st=1;
if(a==0)
fout<<cautare0(x)<<"\n";
if(a==1)
fout<<cautare1(x)<<"\n";
if(a==2)
fout<<cautare2(x)<<"\n";
}
return 0;
}