Pagini recente » Monitorul de evaluare | Cod sursa (job #2361643) | Cod sursa (job #1218162) | Cod sursa (job #2428075) | Cod sursa (job #3324381)
#include <bits/stdc++.h>
#define NMAX 100001
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[NMAX];
int main() {
int n;
in >> n;
for(int i = 1; i <= n; i++) in >> v[i];
int m;
in >> m;
for(int q = 0; q < m; q++) {
int tip, x;
in >> tip >> x;
if(tip == 0) {
int st = 1, dr = n, r = -1;
while(st <= dr) {
int mid = st + (dr - st) / 2;
if(v[mid] == x) {
r = mid;
st = mid + 1;
}
else if(v[mid] < x)
st = mid + 1;
else dr = mid - 1;
}
out << r << "\n";
}
else if(tip == 1) {
int st = 1, dr = n, r = 0;
while(st <= dr) {
int mid = st + (dr - st) / 2;
if(v[mid] <= x) {
r = mid;
st = mid + 1;
}
else dr = mid - 1;
}
out << r << "\n";
}
else if(tip == 2) {
int st = 1, dr = n, r = n+1;
while(st <= dr) {
int mid = st + (dr - st) / 2;
if(v[mid] >= x) {
r = mid;
dr = mid - 1;
}
else st = mid + 1;
}
out << r << "\n";
}
}
return 0;
}