Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 13 KBi |
#2 |
Correcto
|
0.004 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.006 s | 67 KBi |
#5 |
Correcto
|
0.005 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 0 KBi |
#9 |
Correcto
|
0.005 s | 0 KBi |
#10 |
Correcto
|
0.007 s | 0 KBi |
#11 |
Correcto
|
0.024 s | 1 KBi |
#12 |
Correcto
|
0.034 s | 1 KBi |
#13 |
Correcto
|
0.009 s | 1 KBi |
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<n;i++) #define pb push_back #define ff first #define ss second #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define lli long long int #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<endl; return os; } const lli mod=(1e9)+7; const int N = 1e4+1; int main(){ fast_io; int n;cin>>n; int nums[n]; REP(i,n)cin>>nums[i]; int c;cin>>c; while(c--){ int l,r;cin>>l>>r; int mx = -1; int ans; for(int i=r; i>=l; i--){ mx = max(nums[i],mx); if(mx == nums[i])ans=i; } cout<<ans<<endl; } return 0; }