Pagini recente » Cod sursa (job #2887652) | Cod sursa (job #2262233) | Cod sursa (job #2925878) | Cod sursa (job #3244497) | Cod sursa (job #3288533)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream o("cautbin.out");
int main()
{
int N, M, x, acc = 0, curent_pow_2 = 16, v[100001], caz;
f >> N;
for (int i = 1; i <= N; i++)
{
f >> v[i];
}
f >> M;
for (int i = 0; i < M; i++)
{
f >> caz >> x;
curent_pow_2 = 16;
acc = 0;
if (caz == 2)
{
while (curent_pow_2 > 0)
{
if (acc + curent_pow_2 <= N)
if (v[acc + curent_pow_2] < x)
acc += curent_pow_2;
curent_pow_2 >>= 1;
}
acc++;
o << acc<<endl;
}
if (caz == 0)
{
while (curent_pow_2 > 0)
{
if (acc + curent_pow_2 <= N)
if (v[acc + curent_pow_2] <= x)
acc += curent_pow_2;
curent_pow_2 >>= 1;
}
if (v[acc] == x)
o << acc << endl;
else
{
o << -1 << endl;
}
}
if (caz == 1)
{
while (curent_pow_2 > 0)
{
if (acc + curent_pow_2 <= N)
if (v[acc + curent_pow_2] <= x)
acc += curent_pow_2;
curent_pow_2 >>= 1;
}
o<< acc << endl;
}
}
return 0;
}