Pagini recente » Cod sursa (job #1625111) | Cod sursa (job #815631) | Cod sursa (job #2458578) | Cod sursa (job #27640) | Cod sursa (job #2927693)
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main() {
int n, a[100000 + 1], b[100000 + 1];
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> a[i];
}
int m;
fin >> m;
int i = 1;
while (m > 0) {
int nr, x;
fin >> nr >> x;
if (nr == 0 || nr == 1) {
int left = 1, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
//cout << mid << " ";
if (a[mid] <= x) {
left = mid + 1;
} else {
right = mid;
}
}
if (nr == 0) {
if (a[mid] == x) {
b[i] = mid;
++i;
} else {
b[i] = -1;
++i;
}
} else {
if (a[mid] <= x) {
b[i] = mid;
++i;
}
}
} else if (nr == 2) {
int left = 1, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
//cout << mid << " ";
if (a[mid] >= x) {
right = mid;
} else {
left = mid + 1;
}
}
if (a[left] >= x) {
b[i] = left;
++i;
}
}
--m;
}
for (int j = 1; j < i; ++j) {
fout << b[j] << "\n";
}
return 0;
}