Pagini recente » Cod sursa (job #678539) | Cod sursa (job #714250) | Cod sursa (job #1925767) | Cod sursa (job #1077201) | Cod sursa (job #1368739)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N, tip, x, a[100005], M;
int bs01(int val, int tip)
{
int i=0, lg=(1<<30);
for (; lg; lg>>=1)
if (i+lg<=N && a[i+lg]<=val) i+=lg;
if (!tip)
{
if (a[i]!=a[val]) return -1;
else return i;
}
return i;
}
int bs2(int val)
{
int i=N, lg=(1<<30);
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];
f>>M;
while (M--)
{
f>>tip>>x;
if (tip<2) g<<bs01(x, tip)<<'\n';
else g<<bs2(x)<<'\n';
}
return 0;
}