# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46323 | top34051 | Split the sequence (APIO14_sequence) | C++17 | 2 ms | 300 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//noey power
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 5;
const ll inf = 1e16;
int n,m;
int a[maxn];
ll sum[maxn], dp[maxn][205];
int rec[maxn][205];
void go(int x, int k) {
if(x==0) return ;
go(rec[x][k], k-1);
if(x!=n) printf("%d ",x);
}
int main() {
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++) sum[i] = sum[i-1] + a[i];
for(int x=0;x<=n;x++) for(int k=0;k<=m+1;k++) dp[x][k] = -inf;
dp[0][0] = 0;
for(int k=1;k<=m+1;k++) {
for(int x=1;x<=n;x++) {
for(int y=0;y<x;y++) {
ll t = dp[y][k-1] + sum[y]*sum[x] - sum[y]*sum[y];
if(t>dp[x][k]) {
dp[x][k] = t;
rec[x][k] = y;
}
}
}
}
printf("%lld\n",dp[n][m+1]);
go(n,m+1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |