#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100005, K = 205;
ll dp[K][N], sum[N], val[N], m[N], q[N], tot = 0;
int nxt[K][N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> val[i];
tot += val[i];
sum[i] += val[i];
sum[i + 1] += sum[i];
}
for(int i = 0; i < n; i++)
m[i] = tot - (i == 0 ? 0 : sum[i - 1]);
for(int i = 1; i <= k; i++){
int idx = n - 1;
//q[n - 1] = dp[i - 1][n - 1] - m[n - 1] * (tot - sum[n - 2]);
for(int j = n - 1; j >= 0; j--){
ll curr = m[j];
while(idx - 1 > j && m[idx - 1] * curr + q[idx - 1] >= m[idx] * curr + q[idx]) idx--;
nxt[i][j] = idx;
dp[i][j] = m[idx] * curr + q[idx];
q[j] = dp[i - 1][j] - m[j] * m[j];
}
}
cout << dp[k][0] << endl;
int curr = nxt[k][0];
for(int i = k - 1; i >= 0; i--){
cout << curr << " ";
curr = nxt[i][curr];
}
cout << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Incorrect |
2 ms |
384 KB |
position 9 occurs twice in split scheme |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
position 49 occurs twice in split scheme |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Incorrect |
2 ms |
384 KB |
position 199 occurs twice in split scheme |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
512 KB |
position 999 occurs twice in split scheme |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
33 ms |
26144 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Incorrect |
20 ms |
16000 KB |
position 9999 occurs twice in split scheme |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
7040 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
20 ms |
7056 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Runtime error |
168 ms |
131072 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
4 |
Halted |
0 ms |
0 KB |
- |