(I2
I138
I5
(dp0
Vmaxarrea.%l
p1
(Vmaxarrea.cpp
p2
S'#include<iostream>\r\n#include<cstdio>\r\n#include<iomanip>\r\n#include<algorithm>\r\n#include<string>\r\n#include<vector>\r\n#include<queue>\r\n#include<stack>\r\nusing namespace std;\r\nvector<int> v[15000];\r\nint m[15000];\r\nint main()\r\n{\r\n    int n,mina=100000000, a, maxa=0,br=0,maxbr=0,br1=0;\r\n    cin>>n;\r\n    for (int i=0;i<n;i++)\r\n    {\r\n        cin>>a;\r\n        if (a<mina)mina=a;\r\n        if (a>maxa)maxa=a;\r\n        v[a].push_back(i);\r\n    }\r\n    //cout<<"MINA "<<mina<<endl;;\r\n   /* for (int i=0;i<maxa;i++)\r\n    {\r\n        cout<<i<<"| ";\r\n        for(int j=0;j<v[i].size();j++)\r\n        {\r\n         cout<<v[i][j]<<" ";\r\n\r\n        }\r\n        cout<<endl;\r\n    }*/\r\n    for (int i=mina+1;i<=maxa;i++)\r\n    {\r\n        br=0;\r\n        //cout<<"I "<<i<<endl;\r\n        for (int j=i;j<=maxa;j++)\r\n        {\r\n            for (int k=0;k<v[j].size();k++)\r\n            {\r\n                m[br]=v[j][k];\r\n                br++;\r\n            }\r\n        }\r\n        br1=1;\r\n        sort(m,m+br);\r\n        /*for(int k=0;k<br;k++)\r\n        {\r\n         cout<<m[k]<<" ";\r\n        }\r\n        cout<<endl;*/\r\n        for (int j=1;j<br;j++)\r\n        {\r\n\r\n            if (m[j]==m[j-1]+1)\r\n            {br1++;\r\n          //  cout<<endl<<"J="<<j<<" br1="<<br1<<endl;\r\n            }\r\n            else\r\n            {\r\n                if (maxbr<br1*i)maxbr=br1*i;\r\n                br1=1;\r\n            }\r\n        }\r\n        if (maxbr<br1*i)maxbr=br1*i;\r\n      //  cout<<br1<<" "<<i<<" "<<maxbr<<"END"<<endl;\r\n        br1=0;\r\n    }\r\n    //if(mina*n>maxbr)maxbr=mina*n;\r\n    cout<<maxbr<<endl;\r\n}\r\n/**\r\n11\r\n6 5 2 7 8 6 8 3 5 6 7\r\n\r\n\r\n\r\n*/\r\n'
p3
tp4
stp5
.