#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
const int MN = 100100;
const int MK = 222;
const ll INFL = 1e18;
vl w,pr;
ll dp[2][MN];
int pd[MK][MN];
void ds(ll ro, ll l, ll r, ll kl, ll kr) {
if(l > r) {return;}
ll m = (l+r)/2;
ll mo = kl;
ll mv = -1;
for(int i=kl;i<=min(m-1,kr);i++) {
ll pk = dp[(ro&1)^1][i] + pr[i]*(pr[m]-pr[i]);
if(pk > mv) {mv = pk;mo = i;}
}
dp[ro&1][m] = mv;
pd[ro][m] = mo;
ds(ro,l,m-1,kl,mo);
ds(ro,m+1,r,mo,kr);
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
memset(dp,0,sizeof(dp));
int n,k;
cin >> n >> k;
pr.push_back(0);
for(int i=0;i<n;i++) {
ll t;
cin >> t;
w.push_back(t);
pr.push_back(pr.back()+t);
}
for(int i=1;i<=k;i++) {
ds(i,i+1,n,i,n);
}
vl res;
ll bak = n;
for(int i=k;i>0;i--) {
res.push_back(pd[i][bak]);
bak = res.back();
}
cout << dp[k&1][n] << '\n';
reverse(res.begin(),res.end());
for(int i=0;i<k;i++) {
if(i > 0) {cout << " ";}
cout << res[i];
}
cout << '\n';
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
1920 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
2156 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
2028 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
2028 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
2028 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
2924 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
2796 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
2924 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
2156 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
2284 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
3564 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
3564 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
3308 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
3564 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
3564 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2284 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2668 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
2412 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
2412 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
57 ms |
10988 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
2412 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
71 ms |
7404 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
78 ms |
8300 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
61 ms |
8812 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
45 ms |
7532 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
71 ms |
8300 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
77 ms |
10092 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
27 ms |
5080 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
27 ms |
5080 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
617 ms |
82680 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
5336 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1312 ms |
82412 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
803 ms |
58908 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
646 ms |
62936 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
469 ms |
51928 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
641 ms |
59096 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
816 ms |
74712 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
