Pagini recente » Cod sursa (job #2061631) | Cod sursa (job #2553588) | Rating Marcel marcel (Marcel1234) | Rating Buza Alexandru (likepro2) | Cod sursa (job #1117824)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N, M, a[100002], tip, val, pas;
inline int bs01(const int &val, const int &tip)
{
int lg=pas, i=0;
for (; lg; lg>>=1)
if (i+lg<=N && a[i+lg]<=val) i+=lg;
if (!tip && a[i]!=val) return -1;
return i;
}
inline int bs2(int val)
{
int i=N, lg=pas;
for (; lg; lg>>=1)
if (i-lg>0 && a[i-lg]>=val) i-=lg;
return i;
}
int main()
{
f>>N;
for (int i=1; i<=N; ++i)f>>a[i];
for (pas=1; pas<=N; pas<<=1);
f>>M;
for (int i=1; i<=M; ++i)
{
f>>tip>>val;
if (!tip) g<<bs01(val, tip)<<'\n';
else if (tip==1) g<<bs01(val, tip)<<'\n';
else if (tip==2) g<<bs2(val)<<'\n';
}
return 0;
}