#include <iostream>
#include <vector>
#include <assert.h>
#define MAXN 100005
#define MAXK 205
using namespace std;
typedef long long int ll;
vector<ll> dpprev, dpnow;
int n, k, arr[MAXN], dprev[MAXN][MAXK], layer;
int s[MAXN];
void DCT(int a, int b, int op1, int op2) {
if (a > b) return;
int mid = (a + b) / 2;
int theop = op1;
for (int op = max(layer, op1); op <= min(mid-1, op2); op++) {
ll rev = dpprev[op-1] + 1LL * s[op] * (1LL * (s[mid] - s[op]));
if (dpnow[mid-1] < rev)
theop = op,
dpnow[mid-1] = rev,
dprev[mid][layer] = theop;
}
DCT(a, mid-1, op1, theop), DCT(mid+1, b, theop, op2);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
s[0] = 0;
for (int i = 1; i <= n; i++)
s[i] = s[i-1] + arr[i];
for (int i = 1; i <= n; i++)
dpprev.push_back(0),
dpnow.push_back(-1);
for (layer = 1; layer <= k; layer++) {
for (int i = 1; i <= n; i++)
dpnow[i-1] = -1;
DCT(layer, n, 1, n);
dpprev = dpnow;
}
cout << dpnow.back() << "\n";
bool ap = 0;
int cnt = 0;
int x = n;
layer--;
while (dprev[x][layer]) {
if (ap) cout << " ";
cout << dprev[x][layer];
ap = 1;
x = dprev[x][layer];
layer--;
cnt++;
}
cout << "\n";
assert(cnt == k);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
380 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
6 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
380 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
380 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
508 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
504 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
508 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
6 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
508 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
1144 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1144 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
1144 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
6 ms |
1148 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
1144 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
19 ms |
1144 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
1144 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
1144 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
1144 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
10 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
14 ms |
8696 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
8696 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
82 ms |
8696 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
12 ms |
8696 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
98 ms |
8824 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
92 ms |
8824 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
82 ms |
8824 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
60 ms |
8696 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
86 ms |
8696 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
103 ms |
8828 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
117 ms |
83132 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
70 ms |
83168 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1972 ms |
83168 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
77 ms |
83168 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1900 ms |
83172 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1496 ms |
83168 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1248 ms |
83172 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1236 ms |
83172 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1228 ms |
83172 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1667 ms |
83172 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
