Pagini recente » Cod sursa (job #2820685) | Cod sursa (job #1438299) | Cod sursa (job #580649) | Cod sursa (job #251375) | Cod sursa (job #1598612)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int x[200001],n;
int cautare0(int a)
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x[mij]<=a)
st=mij+1;
else dr=mij-1;
}
if(x[dr]==a) return dr;
else return -1;
}
int cautare1(int a)
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x[mij]<=a) st=mij+1;
else dr=mij-1;
}
return dr;
}
int cautare2(int a)
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x[mij]>=a) dr=mij-1;
else st=mij+1;
}
return st;
}
int main()
{
int m;
fin>>n;
for(int i=1;i<=n;i++)
fin>>x[i];
fin>>m;
int t,p;
for(int i=1;i<=m;i++)
{
fin>>t>>p;
if(t==0) fout<<cautare0(p)<<"\n";
else if(t==1) fout<<cautare1(p)<<"\n";
else if(t==2) fout<<cautare2(p)<<"\n";
}
return 0;
}