(I2
I144
I5
(dp0
Vmaxarrea.%l
p1
(Va.cpp
p2
S"# include <bits/stdc++.h>\r\nusing namespace std;\r\n# define fi cin\r\n# define fo cout\r\n# define x first\r\n# define y second\r\nint lg[1000005];\r\nint s[1000005];\r\nint v[4000005];\r\nvoid build(int p,int u,int node)\r\n{\r\n    if (p == u) v[node] = s[p];\r\n    else\r\n    {\r\n        int m = (p+u)/2;\r\n        build(p,m,node<<1);\r\n        build(m+1,u,node<<1|1);\r\n        v[node] = min(v[node<<1],v[node<<1|1]);\r\n    }\r\n}\r\nint query(int p,int u,int l,int r,int node)\r\n{\r\n    if (l <= p && u <= r) return v[node];\r\n    int m = (p+u)/2;\r\n    int mn = 2e9;\r\n    if (l <= m) mn = min(mn,query(p,m,l,r,node<<1));\r\n    if (m+1<=r) mn = min(mn,query(m+1,u,l,r,node<<1|1));\r\n    return mn;\r\n}\r\nint main(void)\r\n{\r\n    int n;\r\n    fi>>n;\r\n    for (int i = 1;i <= n;++i) fi>>s[i];\r\n    build(1,n,1);\r\n    int ans = 0;\r\n    for (int i = 1;i <= n;++i)\r\n        for (int j = i;j <= n;++j)\r\n            ans = max(1ll * ans,1ll * (j - i + 1) * query(1,n,i,j,1));\r\n    fo << ans << '\\n';\r\n    return 0;\r\n}\r\n"
p3
tp4
stp5
.