#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, K, a[100001];
ll pref[100001] = {0};
ll dp[100001][201] = {0};
int last_split[100001][201];
ll eval(int j, int i, int k)
{
return dp[j][k-1] + pref[j] * (pref[i] - pref[j]);
}
int main()
{
cin >> N >> K;
for (int i = 1; i <= N; i++)
{
cin >> a[i];
pref[i] = pref[i-1] + a[i];
}
deque<int> cht;
for (int k = 1; k <= K; k++)
{
cht = deque<int>();
for (int i = k + 1; i <= N; i++)
{
dp[i][k] = 0;
cht.push_back(i - 1);
while (cht.size() >= 2 && eval(cht[0], i, k) <= eval(cht[1], i, k))
cht.pop_front();
dp[i][k] = eval(cht[0], i, k);
last_split[i][k] = cht[0];
}
}
cout << dp[N][K] << '\n';
int i = N;
do
{
i = last_split[i][K];
cout << i << ' ';
} while (--K);
cout << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
2644 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
5 ms |
2692 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
2644 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
6 ms |
2644 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Incorrect |
5 ms |
2692 KB |
contestant didn't find the optimal answer: 4698976842 < 4699030287 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
24020 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
12 ms |
24000 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
52 ms |
24020 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
13 ms |
24020 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
46 ms |
24072 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Incorrect |
45 ms |
24040 KB |
contestant didn't find the optimal answer: 514785562499 < 514790755404 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
67 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |