Pagini recente » Cod sursa (job #3189252) | Cod sursa (job #2710188) | Cod sursa (job #861779) | Cod sursa (job #2177708) | Cod sursa (job #2444825)
#include <fstream>
using namespace std;
int main (){
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
long long int N;
fin >> N;
long long int i, a[100001];
for (i = 1; i <= N; ++i)
fin >> a[i];
long long int M;
fin >> M;
for (i = 1; i <= M; ++i){
long long int intrebare, x;
fin >> intrebare >> x;
long long int left = 1, right = N + 1, mid = 0;
if (intrebare == 0){
right = N;
while (left <= right){
mid = (left + right) / 2;
if (a[mid] > x)
right = mid - 1;
else
left = mid + 1;
}
if (a[right] == x)
fout << right << endl;
else
fout << "-1" << endl;
}
if (intrebare == 1){
while (left < right){
mid = (left + right) / 2;
if (a[mid] <= x)
left = mid + 1;
else
right = mid;
}
fout << left - 1 << endl;
}
if (intrebare == 2){
while (left < right){
mid = (left + right) / 2;
if (a[mid] < x)
left = mid + 1;
else
right = mid;
}
fout << left << endl;
}
}
return 0;
}