(I2
I105
I5
(dp0
Vmaxarrea.%l
p1
(Vmmm.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\n#include<cstring>\r\n#include<queue>\r\nusing namespace std;\r\nint m[1000007];\r\nint main ()\r\n{\r\n    long long n,mx=0;\r\n    cin>>n;\r\n    for (int i=0; i<n; i++)\r\n    {\r\n        cin>>m[i];\r\n        if (m[i]>mx) {mx=m[i];}\r\n    }       \r\n    long long b=0,mx2=0;\r\n    long long ans=n;\r\n    for (int i=mx; i>=2; i--)\r\n    {\r\n        b=0; mx2=0;\r\n        for (int j=0; j<n; j++)\r\n        {\r\n            if (m[j]>=i) {b++;}\r\n            else {if (mx2<b) {mx2=b;} b=0;}\r\n        }\r\n        if (mx2<b) {mx2=b; b=0;}\r\n        if (ans<mx2*i) {ans=mx2*i;}\r\n    }\r\n    cout<<ans<<endl;\r\n    return 0;\r\n}\r\n/*\r\n11\r\n6 5 2 7 8 6 8 3 5 6 7\r\n*/\r\n'
p3
tp4
stp5
.