#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[2500][2500];
ll dpAns[2500][2500];
ll n, k;
ll nums[2000];
ll prefSum[2000];
void explore(int s, int regions) {
if (regions == 0)
{
return;
}
ll split = dpAns[s][regions];
//cout << "Exploring " << s << " " << f << " " << regions << "\n";
//cout << "Answer is " << split << " " << reg << "\n";
cout << split << " ";
explore(split+1, regions - 1);
}
ll getDP(int s, int regions) {
if (regions > n-s)
{
return -1000000000000;
}
if (regions == 0)
{
return 0;
}
if (dp[s][regions] >= 0)
{
return dp[s][regions];
}
ll cand = 0;
for (int i = s; i <= n-regions; i++)
{
ll thisCand = (prefSum[i] - prefSum[s-1]) * (prefSum[n] - prefSum[i]);
ll maxLittleCand = -1;
ll thisLeftRegions = 0;
ll thisLittleCand = getDP(i+1, regions-1);
if (maxLittleCand < thisLittleCand)
{
maxLittleCand = max(maxLittleCand, thisLittleCand);
}
thisCand += maxLittleCand;
if (thisCand >= cand)
{
cand = max(cand, thisCand);
dpAns[s][regions] = i;
}
}
dp[s][regions] = cand;
return cand;
}
int main() {
cin >> n >> k;
cin >> nums[1];
prefSum[1] = nums[1];
prefSum[0] = 0;
for (int i = 1; i < n; i++)
{
cin >> nums[i+1];
prefSum[i+1] = prefSum[i] + nums[i+1];
}
for (int i = 0; i <= n; i++)
{
for (int k = 0; k <= n; k++)
{
dp[i][k] = -1;
}
}
ll ans = getDP(1, k);
cout << ans << "\n";
//cout << "Exploring\n";
explore(1, k);
//cout << "\b\n";
}
Compilation message
sequence.cpp: In function 'll getDP(int, int)':
sequence.cpp:41:12: warning: unused variable 'thisLeftRegions' [-Wunused-variable]
41 | ll thisLeftRegions = 0;
| ^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
896 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
768 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
800 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2304 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
2336 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
2304 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
2304 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
2304 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
2304 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
2304 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
2304 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
2304 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
16256 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
17 ms |
16256 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
518 ms |
17528 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
17 ms |
16256 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
516 ms |
17528 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
485 ms |
17324 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
521 ms |
17632 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
520 ms |
17444 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
157 ms |
16544 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
280 ms |
16824 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
