Pagini recente » Monitorul de evaluare | Borderou de evaluare (job #2051243) | Rating Giorgi Pirosca (GiorgiPirosca) | Profil DianaTodoran | Cod sursa (job #1514137)
#include <iostream>
#include <fstream>
using namespace std;
int n,m,v[100001];
int caut1(int x)
{
int st=1,dr=n,p=-1,m;
while(st<=dr)
{
m=(st+dr)/2;
if(v[m]==x)
{
p=m;
st=m+1;
}
else if(x<v[m])
dr=m-1;
else st=m+1;
}
return p;
}
int caut2(int x)
{
int st=1,dr=n,p=0,m;
while(st<=dr)
{
m=(st+dr)/2;
if(x<v[m])
dr=m-1;
else
{
p=m;
st=m+1;
}
}
return p;
}
int caut3(int x)
{
int st=1,dr=n,p=-1,m;
while(st<=dr)
{
m=(st+dr)/2;
if(x<=v[m])
{
dr=m-1;
p=m;
}
else st=m+1;
}
return p;
}
int main()
{
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int i,a,b;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>a>>b;
if(a==0)
fout<<caut1(b)<<"\n";
else if(a==1)
fout<<caut2(b)<<"\n";
else fout<<caut3(b)<<"\n";
}
fin.close();
fout.close();
return 0;
}