Pagini recente » Cod sursa (job #2707231) | Cod sursa (job #3285490) | Cod sursa (job #3139348) | Cod sursa (job #3262890) | Cod sursa (job #2288101)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
#define NMax 100005
int n, m, v[NMax], step;
int main()
{ int tip, x, i, lg;
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
for (step = 1; step <= n; step <<= 1);
f>>m;
for(int j=1;j<=m;++j)
{
f>>tip>>x;
if(tip<2)
{
for (lg = step, i = 0; lg; lg >>= 1)
if (i + lg <= n && v[i + lg] <= x)i += lg;
if (!tip && v[i] != x)g<<-1<<'\n';
else g<<i<<'\n';
continue;
}
for (lg = step, i = n; lg; lg >>= 1)
if (i - lg > 0 && v[i - lg] >= x)i -= lg;
g<<i<<'\n';
}
return 0;
}