Pagini recente » Cod sursa (job #270833) | Cod sursa (job #3335131) | Cod sursa (job #3326906) | Cod sursa (job #3339707) | Cod sursa (job #3343729)
#include <bits/stdc++.h>
using namespace std;
int v[2000001];
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int main() {
int n;
cin>>n;
for (int i = 0; i < n; i++){
cin>>a[i];
}
int m;
cin>>t;
for(int i=1;i<=t;++i) {
int c, x;
cin>>c>>x;
if (c == 2) {
int* val=lower_bound(v, v + n, x);
cout << (int)(val - v) + 1 << "\n";
}
else if (c == 1) {
int* val=upper_bound(v, v + n, x);
cout<< (int)(val - v) << "\n"; // poziția 1-based a lui (p-1)
}
else {
int* val=upper_bound(v, v + n, x);
if (val == v) {
cout<<-1<<"\n";
} else {
if (*(val - 1) == x)
cout<< (int)(val - v) <<"\n";
else cout<<-1<< "\n";
}
}
}
return 0;
}