(I2
I115
I5
(dp0
Vmaxarrea.%l
p1
(Vmaxarrea.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nlong long n, i, sum, br, ans=1000000ll, a[1000010], dp[1000010], j, maxfree, ans1, k, ans2, ok;\r\nint main()\r\n{\r\n    cin>>n;\r\n    for (i=1; i<=n; i++)\r\n        cin>>a[i];\r\n        \r\n    for (i=1; i<=n; i++)\r\n       {\r\n           dp[a[i]]=max(dp[a[i]-1]*2, a[i]);\r\n       }\r\n       for (i=1; i<=n; i++)\r\n        ans1=max(ans1, dp[i]);\r\n       cout<<ans1<<endl;\r\n    return 0;\r\n}\r\n/*\r\n11\r\n6 5 2 7 8 6 8 3 5 6 7\r\n*/'
p3
tp4
stp5
.