Pagini recente » Cod sursa (job #48397) | Cod sursa (job #2653450) | Cod sursa (job #1685753) | Cod sursa (job #1220159) | Cod sursa (job #2069619)
#include <fstream>
int v[100000];
int main() {
std::ifstream in("cautbin.in");
std::ofstream out("cautbin.out");
int i, n, m;
in >> n;
for (i = 1; i <= n; ++i) {
in >> v[i];
}
in >> m;
int t, x, pas, r;
for (i = 0; i < m; ++i) {
in >> t >> x;
pas = 1 << 16;
r = 0;
if (t < 2)
while (pas > 0) {
if (r + pas < n && v[r + pas] <= x) r += pas;
pas >>= 1;
}
else
while (pas > 0) {
if (r + pas < n && v[r + pas] < x) r += pas;
pas >>= 1;
}
if (t == 0) {
if (v[r] != x) r = -1;
} else if (t == 2) ++r;
out << r << "\n";
}
return 0;
}