Pagini recente » Cod sursa (job #2196941) | Cod sursa (job #1160118) | Cod sursa (job #1387008) | Cod sursa (job #1359454) | Cod sursa (job #2241480)
#include <bits/stdc++.h>
using namespace std;
int bs0(int x, int n, int v[]) {
int lt = -1, rt = n, mid;
while (rt - lt > 1) {
mid = (lt + rt) / 2;
if (v[mid] <= x) {
lt = mid;
} else {
rt = mid;
}
}
if (v[lt] == x) {
return lt + 1;
}
return -1;
}
int bs1(int x, int n, int v[]) {
int lt = -1, rt = n, mid;
while (rt - lt > 1) {
mid = (lt + rt) / 2;
if (v[mid] <= x) {
lt = mid;
} else {
rt = mid;
}
}
return lt + 1;
}
int bs2(int x, int n, int v[]) {
int lt = -1, rt = n, mid;
while (rt - lt > 1) {
mid = (lt + rt) / 2;
if (v[mid] < x) {
lt = mid;
} else {
rt = mid;
}
}
return rt + 1;
}
int main() {
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int m, t, x;
cin >> m;
while (m--) {
cin >> t >> x;
if (t == 0) {
cout << bs0(x, n, v) << '\n';
} else if (t == 1) {
cout << bs1(x, n, v) << '\n';
} else {
cout << bs2(x, n, v) << '\n';
}
}
return 0;
}