Pagini recente » Cod sursa (job #804226) | Cod sursa (job #537858) | Cod sursa (job #123815) | Cod sursa (job #2287506) | Cod sursa (job #2374157)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, t, tip, nr;
int x[100001];
int bs0(int st, int dr, int nr)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(x[m]<=nr) st=m+1;
else dr=m-1;
}
m=(st+dr)/2;
if(x[m]>nr) --m;
if(x[m]==nr) return m;
return -1;
}
int bs1(int st, int dr, int nr)
{
int m;
while(st<dr)
{
m=(st+dr)/2;
if(x[m]<=nr) st=m+1;
else dr=m;
}
m=(st+dr)/2;
if(x[m]>nr) --m;
return m;
}
int bs2(int st, int dr, int nr)
{
int m;
while(st<dr)
{
m=(st+dr)/2;
if(x[m]<nr) st=m+1;
else dr=m;
}
m=(st+dr)/2;
if(x[m]<nr) ++m;
return m;
}
int main()
{
fin>>n;
for(int i=1; i<=n; ++i) fin>>x[i];
fin>>t;
for(int q=1; q<=t; ++q)
{
fin>>tip>>nr;
if(tip==0)
{
int poz=upper_bound(x+1, x+n+1, nr)-x-1;
if(poz>=1 && poz<=n) fout<<poz<<"\n";
else fout<<"-1\n";
}
if(tip==1)
{
int poz=lower_bound(x+1, x+n+1, nr+1)-x-1;
fout<<poz<<"\n";
}
if(tip==2)
{
int poz=upper_bound(x+1, x+n+1, nr-1)-x;
fout<<poz<<"\n";
}
}
return 0;
}