#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ff first
#define ss second
#define N 100001
#define MOD 1000000007
ll p[N];
ll dp[N][2];
int ans[N][200];
int t;
void dnc(int l, int r, int optl, int optr){
if(l > r) return;
int m = (l + r) >> 1;
int be = optl;
dp[m][1] = dp[be][0] + (p[m] - p[be]) * (p[m] - p[be]);
int lim = min(optr, m - 1);
for(int i = optl + 1; i <= lim; ++i){
ll w = dp[i][0] + (p[m] - p[i]) * (p[m] - p[i]);
if(dp[m][1] >= w){
dp[m][1] = w;
be = i;
}
}
ans[m][t] = be;
dnc(l, m - 1, optl, be);
dnc(m + 1, r, be, optr);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin>>n>>k;
for(int i = 1; i <= n; ++i){
cin>>p[i];
p[i] += p[i - 1];
}
for(int i = 1; i <= n; ++i)
dp[i][0] = p[i] * p[i];
for(t = 0; t < k; ++t){
dnc(1, n, 0, n - 1);
for(int j = 1; j <= n; ++j)
swap(dp[j][0], dp[j][1]);
}
cout<<(p[n] * p[n] - dp[n][0]) / 2<<'\n';
for(int i = k - 1; i >= 0; i--){
n = ans[n][i];
cout<<n<<' ';
}
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
380 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
376 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 |
5 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 |
380 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 |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
376 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 |
5 ms |
504 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
504 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 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 |
5 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 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 |
10 ms |
1144 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
1144 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
1144 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1144 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 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 |
6 ms |
1144 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
12 ms |
8368 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
12 ms |
8440 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
75 ms |
8440 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
11 ms |
8440 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
61 ms |
8440 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
59 ms |
8440 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
78 ms |
8568 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
53 ms |
8440 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
58 ms |
8440 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
73 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
62 ms |
81016 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
63 ms |
80904 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1232 ms |
81056 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
62 ms |
81016 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1365 ms |
81020 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
860 ms |
81144 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1051 ms |
81144 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
822 ms |
81016 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
880 ms |
81012 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1177 ms |
81016 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
