Pagini recente » Cod sursa (job #265183) | Cod sursa (job #2128327) | Borderou de evaluare (job #1765718) | Cod sursa (job #2668480) | Cod sursa (job #3285309)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, a[100003], q;
int CB0(int x, int op)
{
int st, dr, mij, p;
p = -1;
st = 1; dr = n;
while (st <= dr)
{
mij = (st + dr) / 2;
if (a[mij] <= x)
{
p = mij;
st = mij + 1;
}
else dr = mij - 1;
}
if (a[p] == x) return p;
return -1;
}
int CB1(int x, int op)
{
int st, dr, mij, p;
p = -1;
st = 1; dr = n;
while (st <= dr)
{
mij = (st + dr) / 2;
if (a[mij] <= x)
{
p = mij;
st = mij + 1;
}
else dr = mij - 1;
}
return p;
}
int CB2(int x, int op)
{
int st, dr, mij, p;
p = -1;
st = 1; dr = n;
while (st <= dr)
{
mij = (st + dr) / 2;
if (a[mij] >= x)
{
p = mij;
dr = mij - 1;
}
else st = mij + 1;
}
return p;
}
int main()
{
int i, op, x;
fin >> n;
for (i = 1; i <= n; i++)
fin >> a[i];
fin >> q;
for (i = 1; i <= q; i++)
{
fin >> op >> x;
if (op == 0) fout << CB0(x, op) << "\n";
else if (op == 1) fout << CB1(x, op) << "\n";
else fout << CB2(x, op) << "\n";
}
return 0;
}
//0, 1, 3-5, 7-18, 21, 22, 24-27, 29, 30, 34-36, 42, 44, 45, 47, 48, 51, 54, 56-58