Pagini recente » Cod sursa (job #1178606) | Cod sursa (job #315441) | Cod sursa (job #2373366) | Cod sursa (job #1253506) | Cod sursa (job #2329708)
/*
ID: gabriel100
LANG: C++
TASK:
*/
#include <cstdio>
#include <algorithm>
//#include <time.h>
#include <queue>
#include <cmath>
#include <stack>
#include <fstream>
#include <bitset>
#include <set>
#define nl '\n'
#define F first
#define S second
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define eb(x) emplace_back(x)
#define ull unsigned long long
#define ll long long
#define ProblemName "cautbin"
#define LocalName "data"
#ifdef INFOARENA
#define Filename ProblemName
#else
#define Filename LocalName
#endif
#define Input Filename".in"
#define Output Filename".out"
using namespace std;
ifstream cin(Input);
ofstream cout(Output);
template<class a, class type>
void print(a v, type t) {
for_each(all(v), [](type x) { cout << x << ' '; });
cout << nl;
}
int n;
int main() {
ios_base::sync_with_stdio(false);
//clock_t tStart = clock();
cin >> n;
vi v(n);
for(int i=0;i<n;++i){
cin >> v[i];
}
int q,cod,x;
cin >> q;
while(q--){
cin >> cod >> x;
if(!cod){
auto upper = upper_bound(all(v),x);
cout << ((*prev(upper)==x) ? upper-v.begin() : -1) << nl;
} else if(cod == 1){
auto upper = upper_bound(all(v),x);
cout << upper-v.begin() << nl;
} else{
auto lower = lower_bound(all(v),x);
cout << lower-v.begin()+1 << nl;
}
}
cout.close();
//printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}