// And you curse yourself for things you never done
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e5 + 10, maxk = 210, mod = 1e9 + 7;
const ll inf = 1e18 + 10;
int a[maxn];
ll dp[maxn], divi[maxn], cst[maxn], sm[maxn], sm2[maxn];
int restore[maxk][maxn], bef[maxn];
ll f(int l, int r){
return 1ll * (sm[r] - sm[l-1]) * (sm[r] - sm[l-1]) - (sm2[r] - sm2[l-1]) + dp[l-1];
}
void solve(int l, int r, int L, int R){
if(l > r)
return;
int mid = (l+r) >> 1;
divi[mid] = inf;
int pos = -1;
for(int i = min(mid, R); i >= L; i--){
ll num = f(i, mid);
if(num < divi[mid])
divi[mid] = num, pos = i;
}
bef[mid] = pos - 1;
solve(l, mid-1, L, pos);
solve(mid+1, r, pos, R);
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie();
int n, k;
cin >> n >> k;
++k;
for(int i = 1; i <= n; i++){
cin >> a[i];
sm[i] = sm[i-1] + a[i];
sm2[i] = sm2[i-1] + 1ll * a[i] * a[i];
}
for(int i = 1; i <= n; i++){
dp[i] = sm[i] * sm[i] - sm2[i];
}
for(int i = 2; i <= k; i++){
solve(1, n, 1, n);
memcpy(dp, divi, sizeof dp);
memcpy(restore[i], bef, sizeof bef);
}
ll ANS = (1ll * sm[n] * sm[n] - sm2[n] - dp[n]) / 2;
vector<int> v;
int tmp = n;
for(int i = k; i >= 2; i--){
tmp = restore[i][tmp];
v.PB(tmp);
}
reverse(v.begin(), v.end());
cout << ANS << "\n";
for(int x : v){
cout << x << " ";
}
return cout << endl, 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
1920 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
1536 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
3072 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
4736 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
1536 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
1536 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
1536 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
2688 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
4 ms |
2688 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
2688 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
2688 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
19 ms |
20352 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
5120 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
4 ms |
3840 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
11 ms |
11008 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
7 ms |
5504 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
3840 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
7 ms |
6656 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
70 ms |
79096 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
51 ms |
55928 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
65 ms |
71672 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
70 ms |
79096 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
18 ms |
18432 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
12 ms |
12160 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
21 ms |
23032 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
2304 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
75 ms |
79096 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
2432 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
78 ms |
79452 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
66 ms |
67704 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
87 ms |
79508 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
75 ms |
79484 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
18 ms |
16896 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
33 ms |
32504 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
2592 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
2720 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
147 ms |
79736 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
2688 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
119 ms |
48504 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
119 ms |
56312 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
120 ms |
60152 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
91 ms |
49260 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
116 ms |
56248 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
149 ms |
72060 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
5500 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
35 ms |
5528 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
842 ms |
82808 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
28 ms |
5500 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1448 ms |
82664 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
899 ms |
59256 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
816 ms |
63224 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
606 ms |
52180 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
797 ms |
59156 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1012 ms |
74900 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
