Pagini recente » Cod sursa (job #2200878) | Cod sursa (job #2100674) | Cod sursa (job #1708469) | Cod sursa (job #2203712) | Cod sursa (job #2283580)
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
const int LMAX = 100005;
const int L = 16;
int n, m, caz, x, v[LMAX];
int caut0 (int x)
{
int r = 0, pas = 1 << L;
while (pas != 0)
{
if (r + pas <= n && v[r + pas] <= x)
r += pas;
pas /= 2;
}
if (v[r] != x)
r = -1;
return r;
}
int caut1 (int x)
{
int r = 0, pas = 1 << L;
while (pas != 0)
{
if (r + pas <= n && v[r + pas] <= x)
r += pas;
pas /= 2;
}
return r;
}
int caut2 (int x)
{
int r = 0, pas = 1 << L;
while (pas != 0)
{
if (r + pas <= n && v[r + pas] < x)
r += pas;
pas /= 2;
}
r++;
return r;
}
int main()
{
in >> n;
for (int i = 1; i <= n; ++i)
in >> v[i];
in >> m;
for (int t = 1; t <= m; ++t)
{
in >> caz >> x;
if (caz == 0)
out << caut0(x) << '\n';
if (caz == 1)
out << caut1(x) << '\n';
if (caz == 2)
out << caut2(x) << '\n';
}
return 0;
}