This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long lint;
int n;
lint dp[1000005];
lint a[1000005];
lint s1[1000005];
lint s2[1000005];
int main(){
scanf("%d",&n);
for(int i=1; i<=n; i++){
scanf("%lld",&a[i]);
s1[i] = s1[i-1] + a[i];
s2[i] = s2[i-1] + s1[i];
}
for(int i=1; i<=n; i++){
dp[i] = dp[i-1];
for(int j=0; j<i; j++){
dp[i] = max(dp[i], dp[j] + s1[i] * (i - j) - s2[i-1] + (j ? s2[j-1] : 0));
}
}
printf("%lld",dp[n]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |