(I2
I118
I5
(dp0
Vmaxarrea.%l
p1
(Vmaxarrea.cpp
p2
S'#include <cstdio>\r\n#include <vector>\r\nusing namespace std;\r\n\r\nint n, szm;\r\nvector <int> d;\r\nlong long int m[1024][1024], ans;\r\n\r\nint main(){\r\n    \r\n    scanf("%d", &n);\r\n    \r\n    int tmp;\r\n    scanf("%d", &tmp); d.push_back(tmp); szm = tmp;\r\n    for(int i = 1; i < n; i ++)\r\n    {\r\n        scanf("%d", &tmp); d.push_back(tmp);\r\n        if(tmp > szm) szm = tmp;\r\n    }\r\n    \r\n    for(int i = 0; i < szm; i ++)\r\n    {\r\n        for(int j = 0; j < n; j ++)\r\n        {\r\n            if(d[j] <= i) m[i][j] = -1;\r\n            else\r\n            {\r\n                if(j == 0) m[i][j] = i+1;\r\n                else if (m[i][j-1] == -1) m[i][j] = i+1;\r\n                else m[i][j] = m[i][j-1] + (i+1);\r\n                \r\n                if(m[i][j] > ans) ans = m[i][j];\r\n            }\r\n        }\r\n    }\r\n    \r\n    printf("%d\\n", ans);\r\n\r\nreturn 0;\r\n}\r\n/*\r\n11\r\n6 5 2 7 8 6 8 3 5 6 7\r\n*/'
p3
tp4
stp5
.