Pagini recente » Cod sursa (job #2501828) | Cod sursa (job #1547279) | Monitorul de evaluare | Cod sursa (job #1464274) | Cod sursa (job #2258691)
#include <fstream>
using namespace std;
int n,m,a[100001];
int cautbin0(int x)
{
int st=1,dr=n,mij,poz=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]==x)
{
poz=mij;
st=mij+1;
}
if(a[mij]<x)
st=mij+1;
if(a[mij]>x)
dr=mij-1;
}
return poz;
}
int cautbin1(int x)
{
int st=1,dr=n,mij,poz;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]<=x)
{
poz=mij;
st=mij+1;
}
else
dr=mij-1;
}
return poz;
}
int cautbin2(int x)
{
int st=1,dr=n,mij,poz;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]>=x)
{
poz=mij;
dr=mij-1;
}
else
st=mij+1;
}
return poz;
}
int main()
{
int tip,x;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
fin>>m;
for(int i=1;i<=m;i++)
{
fin>>tip>>x;
if(tip==0)
fout<<cautbin0(x)<<"\n";
if(tip==1)
fout<<cautbin1(x)<<"\n";
if(tip==2)
fout<<cautbin2(x)<<"\n";
}
fin.close();
fout.close();
return 0;
}