(I2
I143
I5
(dp0
Vmaxarrea.%l
p1
(Vmaxarea3.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\n#include <utility>\r\n#include <vector>\r\n\r\nusing namespace std;\r\n\r\nvector<pair<int, int> >field;\r\n\r\nint main()\r\n{\r\n    int n;\r\n    long long max = 0;\r\n    cin >> n;\r\n    for(int i = 0;i < n;++ i)\r\n    {\r\n        int a;\r\n        cin >> a;\r\n        field.push_back(pair<int, int>(a, i));\r\n    }\r\n\r\n    sort(field.begin(), field.end());\r\n\r\n    for(int i = 0;i < field.size();++ i)\r\n    {\r\n        //cout << field[i].second << endl;\r\n        int left = -99, right = -99;\r\n\r\n        for(int j = i-1;j >= 0; -- j)\r\n        {\r\n            if(field[j].second > field[i].second)\r\n            {\r\n                if(right == -99)\r\n                {\r\n                    right = j;\r\n                }\r\n                else if(field[j].second < field[right].second)\r\n                {\r\n                    //cout << "new right " << field[j].second << endl;\r\n                    right = j;\r\n                }\r\n            }\r\n        }\r\n        for(int j = i-1;j >= 0; -- j)\r\n        {\r\n            if(field[j].second < field[i].second)\r\n            {\r\n                if(left == -99)\r\n                {\r\n                    left = j;\r\n                }\r\n                else if(field[j].second > field[left].second)\r\n                {\r\n                    //cout << "new left " << field[j].second << endl;\r\n                    left = j;\r\n                }\r\n            }\r\n        }\r\n\r\n\r\n        int Xstart, Xend;\r\n        if(left == -99)\r\n            Xstart = 0;\r\n        else\r\n            Xstart = field[left].second + 1;\r\n\r\n        if(right == -99)\r\n            Xend = n - 1;\r\n        else\r\n            Xend = field[right].second - 1;\r\n\r\n        //cout << Xstart << " " << Xend << endl;\r\n        //cout << "-----> " << (Xend-Xstart+1) * field[i].first << endl;\r\n        if((Xend-Xstart+1) * field[i].first > max)\r\n            max = (Xend-Xstart+1) * field[i].first;\r\n    }\r\n\r\n    cout << max << endl;\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.