Pagini recente » Cod sursa (job #1644483) | Cod sursa (job #610031) | Cod sursa (job #1981985) | Cod sursa (job #1464782) | Cod sursa (job #1907357)
#include<fstream>
#include<algorithm>
#define DMAX 100001
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,a[DMAX],i,x,poz,intrebare;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>intrebare>>x;
if(intrebare==0)
{
poz=upper_bound(a+1,a+n+1,x)-a-1;
if(poz>=1 && poz<=n && a[poz]==x)
fout<<poz<<'\n';
else
fout<<-1<<'\n';
}
else if(intrebare==1)
{
poz=upper_bound(a+1,a+n+1,x)-a-1;
fout<<poz<<'\n';
}
else
{
poz=upper_bound(a+1,a+n+1,x-1)-a;
fout<<poz<<'\n';
}
}
return 0;
}