Pagini recente » Cod sursa (job #353729) | Cod sursa (job #599129) | Cod sursa (job #1699673) | Monitorul de evaluare | Cod sursa (job #3344995)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100001];
int n;
int main() {
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
int m;
fin >> m;
while (m--) {
int tip, x;
fin >> tip >> x;
int st = 1, dr = n, ans = -1;
if (tip == 0) {
while (st <= dr) {
int mid = (st + dr) / 2;
if (v[mid] <= x) {
if (v[mid] == x) ans = mid;
st = mid + 1;
} else
dr = mid - 1;
}
fout << ans << "\n";
}
if (tip == 1) {
while (st <= dr) {
int mid = (st + dr) / 2;
if (v[mid] <= x) {
ans = mid;
st = mid + 1;
} else
dr = mid - 1;
}
fout << ans << "\n";
}
if (tip == 2) {
while (st <= dr) {
int mid = (st + dr) / 2;
if (v[mid] >= x) {
ans = mid;
dr = mid - 1;
} else
st = mid + 1;
}
fout << ans << "\n";
}
}
return 0;
}