Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <string>
- #include <iomanip>
- #include <queue>
- #include <cmath>
- #include <algorithm>
- #include <tuple>
- #include <iomanip>
- #include <stdio.h>
- #include <numeric>
- #include <map>
- #include <bitset>
- #include <set>
- #include <stack>
- #include <queue>
- /*
- #pragma GCC optimize("Ofast,no-stack-protector")
- #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
- #pragma GCC optimize("unroll-loops")
- #pragma GCC optimize("fast-math")
- #pragma GCC optimize("section-anchors")
- #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
- #pragma GCC optimize("vpt")
- #pragma GCC optimize("rename-registers")
- #pragma GCC optimize("move-loop-invariants")
- #pragma GCC optimize("unswitch-loops")
- #pragma GCC optimize("function-sections")
- #pragma GCC optimize("data-sections")
- #pragma GCC optimize("branch-target-load-optimize")
- #pragma GCC optimize("branch-target-load-optimize2")
- #pragma GCC optimize("btr-bb-exclusive")
- */
- #define int long long
- #define ll long long
- #define ull unsigned long long
- #define all(a) a.begin(), a.end()
- #define pii pair<int, int>
- #define pb push_back
- #define ld long double
- using namespace std;
- //const int INF = 1e13;
- //const int mod = 2600000069;
- //const int p = 179;
- struct wat {
- int val, pos;
- wat(int val_, int pos_) {
- val = val_;
- pos = pos_;
- }
- wat() {
- val = 0;
- pos = 0;
- }
- };
- vector<wat> t;
- vector<int> a;
- wat merge(wat a, wat b) {
- wat ans;
- if (a.val >= b.val) {
- ans.val = a.val;
- ans.pos = a.pos;
- } else {
- ans.val = b.val;
- ans.pos = b.pos;
- }
- return ans;
- }
- void build(int v, int l, int r) {
- if (r - l == 1) {
- t[v] = wat(a[l], l);
- return;
- }
- int m = (l + r) / 2;
- build(2 * v + 1, l, m);
- build(2 * v + 2, m, r);
- t[v] = merge(t[2 * v + 1], t[2 * v + 2]);
- }
- wat get_ans(int v, int l, int r, int askl, int askr) {
- if (l >= askr || r <= askl) {
- return wat();
- }
- if (l >= askl && r <= askr) {
- return t[v];
- }
- int m = (l + r) / 2;
- return merge(get_ans(2 * v + 1, l, m, askl, askr), get_ans(2 * v + 2, m, r, askl, askr));
- }
- signed main() {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- freopen("index-max.in", "r", stdin);
- freopen("index-max.out", "w", stdout);
- int n;
- cin >> n;
- a.resize(n);
- t.resize(4 * n);
- for (int i = 0; i < n; i++) cin >> a[i];
- build(0, 0, n);
- int l, r;
- int q;
- cin >> q;
- while (q--) {
- cin >> l >> r;
- --l;
- cout << get_ans(0, 0, n, l, r).pos + 1 << "\n";
- }
- }
- /*
- 5
- 2 2 2 1 5
- 2
- 2 3
- 2 5
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement