(I2
I133
I5
(dp0
Vmaxarrea.%l
p1
(Vmaxarrea.cpp
p2
S"#include<iostream>\r\n#define INF 42000\r\nusing namespace std;\r\nint n,m=1,tree[2000005];\r\nlong long s;\r\nvoid buildTree()\r\n{\r\n    for (int i=m-1; i>0; i--)\r\n        tree[i]=min(tree[i*2],tree[i*2+1]);\r\n}\r\nint findMin(int p, int q, int l, int r, int idx)\r\n{\r\n    if (l>r || q<l || r<p)\r\n        return INF;\r\n    if (p<=l && r<=q)\r\n        return tree[idx];\r\n    int mid=(l+r)/2;\r\n    return min(findMin(p,q,l,mid,idx*2),findMin(p,q,mid+1,r,idx*2+1));\r\n}\r\nint main()\r\n{\r\n    ios::sync_with_stdio(false);\r\n    cin.tie(NULL);\r\n    cin>>n;\r\n    while (m<n)\r\n        m*=2;\r\n    for (int i=0; i<n; i++)\r\n        cin>>tree[i+m];\r\n    for (int i=m+n; i<m*2; i++)\r\n        tree[i]=INF;\r\n    buildTree();\r\n    for (int i=0; i<n; i++)\r\n        for (int j=1; j<=n-i; j++)\r\n        {\r\n            int z=findMin(j,j+i,1,m,1);\r\n            if (z!=INF)\r\n                s=max(s,(long long)z*(i+1));\r\n        }\r\n    cout<<s<<'\\n';\r\n    return 0;\r\n}\r\n"
p3
tp4
stp5
.