#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MN = 10001; // maxn for subtask 5
const int MK = 201;
int N, K;
ll A[MN], pref[MN];
ll dp[2][MN];
int path[MK][MN];
bool chmx(ll& a, const ll b) {return (a <= b) ? (a=b), true : false;}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> N >> K;
for (int i=0; i<N; ++i) {
cin >> A[i];
pref[i+1] = pref[i] + A[i];
}
for (int k=1; k<=K; ++k) {
for (int i=0; i<N; ++i) {
dp[k&1][i] = 0;
ll left = 0, right = pref[N] - pref[i];
for (int j=i; j+1<N; ++j) {
left += A[j];
right -= A[j];
//cerr << "k,i,j,L,R: " << k << ' ' << i << ' ' << j << ' ' << left << ' ' << right << endl;
if (chmx(dp[k&1][i], dp[!(k&1)][j+1] + left * right)) {
path[k][i] = j+1;
}
}
}
}
cout << dp[K&1][0] << endl;
vector<int> ans;
ans.push_back(path[K][0]);
for (int i=K-1; i>0; --i) {
ans.push_back(path[i][ans.back()]);
}
for (int i=0; i<K; ++i) {
if (i) cout << ' ';
cout << ans[i];
}
cout << endl;
}
/*
7 3
4 1 3 4 0 2 3
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
488 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
6 ms |
1260 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
5 ms |
1004 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
6 ms |
1260 KB |
Integer 0 violates the range [1, 199] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
396 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
3 ms |
364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
123 ms |
2020 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
3 ms |
364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
117 ms |
2020 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
101 ms |
1868 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
119 ms |
2020 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
117 ms |
2020 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
24 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
48 ms |
996 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
220 ms |
868 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
193 ms |
868 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2087 ms |
2404 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
620 KB |
Integer 0 violates the range [1, 99999] |
2 |
Halted |
0 ms |
0 KB |
- |