Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.001 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.001 s | 0 KBi |
#4 |
Correcto
|
0.001 s | 0 KBi |
#5 |
Correcto
|
0.006 s | 69 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.003 s | 1 KBi |
#8 |
Correcto
|
0.002 s | 0 KBi |
#9 |
Correcto
|
0.001 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.002 s | 0 KBi |
#12 |
Correcto
|
0.002 s | 0 KBi |
#13 |
Correcto
|
0.002 s | 0 KBi |
#14 |
Correcto
|
0.104 s | 3 KBi |
#15 |
Correcto
|
0.02 s | 3 KBi |
#16 |
Correcto
|
0.026 s | 3 KBi |
#17 |
Correcto
|
0.099 s | 3 KBi |
#18 |
Correcto
|
0.06 s | 3 KBi |
#19 |
Correcto
|
0.018 s | 3 KBi |
#20 |
Correcto
|
0.037 s | 3 KBi |
#21 |
Correcto
|
0.02 s | 3 KBi |
#22 |
Correcto
|
0.102 s | 3 KBi |
#23 |
Correcto
|
0.098 s | 3 KBi |
#24 |
Correcto
|
0.026 s | 3 KBi |
#25 |
Correcto
|
0.026 s | 3 KBi |
#26 |
Correcto
|
0.046 s | 3 KBi |
#27 |
Correcto
|
0.03 s | 3 KBi |
#28 |
Correcto
|
0.03 s | 3 KBi |
#29 |
Correcto
|
0.037 s | 3 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 #include <assert.h> #define ii pair<int,int> #define vii vector<ii> #define lli long long int #define vi vector<lli> using namespace std; ostream& operator<<(ostream& os, const vector<lli> &v){ for(auto const &i: v){ os<<i<<" "; } os<<endl; return os; } int main(){ lli n; cin>>n; vi a(n); for(int i = 0; i<n; i++){ cin>>a[i]; } stack<lli> q; //left to right vi lef(n,0); for(int i = 0; i<n; i++){ while(q.size() > 0 && a[q.top()] >= a[i]){ q.pop(); } lef[i] = (q.size() ? q.top() +1 : 0); q.push(i); } while(q.size())q.pop(); vi rai(n,n-1); for(int i = n-1; i>=0; i--){ while(q.size() > 0 && a[q.top()] >= a[i]){ q.pop(); } rai[i] = (q.size() ? q.top() - 1 : n-1); q.push(i); } lli ans = 0; for(int i = 0; i<n; i++){ ans = max(ans,(abs(rai[i]-lef[i])+1)*a[i]); } cout<<ans<<endl; return 0; }