Pagini recente » Cod sursa (job #158133) | Cod sursa (job #310720) | Cod sursa (job #206249) | Cod sursa (job #2180054) | Cod sursa (job #3257732)
#include <fstream>
#define int long long
using namespace std;
ifstream fcin("cautbin.in");
ofstream fout("cautbin.out");
int n,k,v[100001],sol,m,t,x;
inline int cb1(int val)
{
int st=1;
int dr=n;
int sol=-1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]<=val)
{
if(v[mij]==val)
sol=mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
return sol;
}
inline int cb2(int val)
{
int st=1;
int dr=n;
int sol=-1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]<=val)
{
sol=mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
return sol;
}
inline int cb3(int val)
{
int st=1;
int dr=n;
int sol=-1;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]>=val)
{
sol=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
return sol;
}
signed main()
{
fcin>>n;
for(int i=1; i<=n; i++)
{
fcin>>v[i];
}
fcin>>m;
while(m--)
{
fcin>>t>>x;
if(t==0)
{
fout<<cb1(x)<<'\n';
}
if(t==1)
{
fout<<cb2(x)<<'\n';
}
if(t==2)
{
fout<<cb3(x)<<'\n';
}
}
return 0;
}