Pagini recente » Cod sursa (job #2490071) | Cod sursa (job #175799) | Cod sursa (job #2748835) | Cod sursa (job #2676552) | Cod sursa (job #2927690)
#include <iostream>
#include <cstring>
using namespace std;
int main() {
int n, a[100000 + 1];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int m;
cin >> m;
while (m > 0) {
int nr, x;
cin >> 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) {
cout << mid << "\n";
} else {
cout << -1 << "\n";
}
} else {
if (a[mid] <= x) {
cout << mid << "\n";
}
}
} 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) {
cout << left << "\n";
}
}
--m;
}
return 0;
}