Submission #73156768

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
const ll INF = (1LL << 60);
const ll MOD = 998244353;

struct seg {
    int n;
    vector<int> t;
    seg(int n): n(n), t(4*n, 1) {}
    void upd(int id, int v, int x, int lx, int rx){
        if(lx == rx){
            t[x] = v;
            return;
        }
        int m = (lx + rx) / 2;
        if(id <= m) upd(id, v, x*2, lx, m);
        else upd(id, v, x*2+1, m+1, rx);
        t[x] = t[x*2] * t[x*2+1];
    }
    void upd(int id, int v){
        upd(id, v, 1, 1, n);
    }
    int qry(int l, int r, int x, int lx, int rx){
        if(r < lx || rx < l) return 1;
        if(l <= lx && rx <= r) return t[x];
        int m = (lx + rx) / 2;
        return qry(l, r, x*2, lx, m) *
               qry(l, r, x*2+1, m+1, rx);
    }
    int qry(int l, int r){
        return qry(l, r, 1, 1, n);
    }
};

int sign(int x){
    if(x > 0) return 1;
    if(x < 0) return -1;
    return 0;
}



int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, l, r;
    cin >> n >> l >> r;
    int a = -1, b = -1;
    for (int i = 1; i <= n; i++) {
        int p;
        cin >> p;
        if (p < l || p > r) continue;
        if (p > a) {
            a = p;
            b = i;
        }
    }
    cout << b << '\n';
    return 0;
}

Submission Info

Judge Result