Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.005 s | 0 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Correcto
|
0.005 s | 12 KBi |
#6 |
Correcto
|
0.005 s | 17 KBi |
#7 |
Correcto
|
0.002 s | 0 KBi |
#8 |
Correcto
|
0.001 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 1 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.003 s | 0 KBi |
#12 |
Correcto
|
0.005 s | 0 KBi |
#13 |
Correcto
|
0.004 s | 1 KBi |
#14 |
Correcto
|
0.032 s | 1 KBi |
#15 |
Correcto
|
0.043 s | 1 KBi |
#16 |
Incorrecto
|
0.227 s | 5 KBi |
#17 |
Correcto
|
0.197 s | 4 KBi |
#18 |
Correcto
|
0.037 s | 1 KBi |
#19 |
Correcto
|
0.065 s | 1 KBi |
#20 |
Correcto
|
0.11 s | 1 KBi |
#21 |
Correcto
|
0.081 s | 1 KBi |
#22 |
Incorrecto
|
0.266 s | 7 KBi |
#23 |
Correcto
|
0.2 s | 14 KBi |
#24 |
Correcto
|
0.03 s | 1 KBi |
#25 |
Correcto
|
0.068 s | 1 KBi |
#26 |
Incorrecto
|
0.26 s | 2 KBi |
#27 |
Correcto
|
0.148 s | 7 KBi |
#28 |
Correcto
|
0.328 s | 7 KBi |
#29 |
Incorrecto
|
0.265 s | 7 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 deque<lli> &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; deque<lli> nums; map<lli,lli> dir; lli tmp; for(int i = 0; i < n; i++){ cin>>tmp; nums.pb(tmp); dir[nums[i]]++; } auto it = *dir.begin(); lli l = nums.front(), r = nums.back(); lli ans = 0LL; while(nums.size() > 0){ lli min_el = (*dir.begin()).ff; //cout<<"min "<<min_el<<" len "<<nums.size()<<endl; lli cur_size = nums.size() * min_el; ans = max(ans,cur_size); //borrar el extremo más bajito lli num = -1; if(nums.front() < nums.back()){ num = nums.front(); nums.pop_front(); } else{ num = nums.back(); nums.pop_back(); } dir[num]--; if(dir[num]<=0)dir.erase(num); } cout<<ans<<endl; return 0; }