#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz size()
const int N = 1e5 + 5;
ll a[N], dp[N][205], par[N][205], p[N];
int n, k;
ll sum (int x, int y) {
return p[y] - p[x - 1];
}
int main () {
// freopen ("sequence.in", "r", stdin);
// freopen ("sequence.out", "w", stdout);
// freopen ("input.txt", "r", stdin);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
reverse (a + 1,a + n + 1);
for (int i = 1; i <= n; ++i) {
p[i] = p[i - 1] + a[i];
}
// dp[i][j] i-cenli j grupba bolemde maximum value.
for (int i = 2; i <= n; ++i) {
for (int x = 2; x <= min (i, k + 1); ++x) {
for (int j = x - 1; j < i; ++j) {
// dp[i][x] = max (dp[i][x], dp[j][x - 1] + sum (j + 1, i) * sum (1, j));
ll val = dp[j][x - 1] + sum (j + 1, i) * sum (1, j);
if (dp[i][x] < val) {
par[i][x] = j;
dp[i][x] = val;
}
}
}
}
// cout << dp[n][k + 1];
// return 0;
vector <int> cyk;
int y = k + 1, x = n;
while (1) {
x = par[x][y];
if (!x) break;
cyk.pb (x);
y--;
}
cout << dp[n][k + 1] << "\n";
// assert ((int)cyk.sz == k);
for (int i : cyk) {
// cout << n - i - 1<< " ";
cout << n - i << " ";
// cout << i << "\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Incorrect |
0 ms |
2396 KB |
Unexpected end of file - int32 expected |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
4652 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
4540 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
3 ms |
4700 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
3 ms |
4860 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
3 ms |
4700 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
3 ms |
4700 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8028 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
4 ms |
8028 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
112 ms |
8272 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
4 ms |
8024 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
195 ms |
8040 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
173 ms |
8024 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
101 ms |
8128 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
99 ms |
8028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
39 ms |
8024 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
77 ms |
8120 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
364 ms |
37032 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
542 ms |
36980 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2058 ms |
16948 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2027 ms |
67952 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |