Pagini recente » Cod sursa (job #587190) | Cod sursa (job #817593) | Cod sursa (job #2878780) | Cod sursa (job #442300) | Cod sursa (job #2701826)
#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
// #define f cin
// #define g cout
int v[100009], q, n, m;
int bs(int);
int lb(int);
int ub(int);
int main()
{
ios_base::sync_with_stdio(false);
f.tie(nullptr);
f >> n;
for (int i = 1; i <= n; i++)
f >> v[i];
f >> m;
for (int c, x; m; m--)
{
f >> c >> x;
if (!c)
g << bs(x) << '\n';
else if (c == 1)
g << lb(x) << '\n';
else
g << ub(x) << '\n';
}
return 0;
}
int bs(int x)
{
int p = -1;
for (int st = 1, dr = n; st <= dr;)
{
int mid = st + ((dr - st) >> 1);
if (v[mid] == x)
p = mid, st = mid + 1;
else if (v[mid] < x)
st = mid + 1;
else
dr = mid - 1;
}
return p;
}
int lb(int x)
{
int p;
for (int st = 1, dr = n; st <= dr;)
{
int mid = st + ((dr - st) >> 1);
if (v[mid] <= x)
p = mid, st = mid + 1;
else
dr = mid - 1;
}
return p;
}
int ub(int x)
{
int p;
for (int st = 1, dr = n; st <= dr;)
{
int mid = st + ((dr - st) >> 1);
if (v[mid] >= x)
p = mid, dr = mid - 1;
else
st = mid + 1;
}
return p;
}