(I2
I144
I5
(dp0
Vmaxarrea.%l
p1
(Va.cpp
p2
S'# include <bits/stdc++.h>\r\nusing namespace std;\r\n# define x first\r\n# define y second\r\n# define fo cout\r\npair < int , int > s[1000005];\r\nint main(void)\r\n{\r\n    int n;\r\n    scanf("%d\\n",&n);\r\n    for (int i = 1;i <= n;++i) scanf("%d",&s[i].x),s[i].y = i;\r\n    sort(s+1,s+1+n);\r\n    long long ans = 0;\r\n    set < int > num;\r\n    num.insert(0);num.insert(n+1);\r\n    for (int i = 1;i <= n;++i)\r\n    {\r\n        auto it = num.lower_bound(s[i].y);\r\n        while (it != num.begin() && *it > s[i].y) --it;\r\n        int p = *it;\r\n        while (it != num.end() && *it < s[i].y) ++it;\r\n        int u = *it;\r\n        ans = max(ans,1ll * s[i].x * (u - p - 1));\r\n        num.insert(s[i].y);\r\n    }\r\n    fo << ans << \'\\n\';\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.