#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define sp ' '
#define nl '\n'
void sc(){}template<class T,class...A>void sc(T&t,A&...a){cin>>t,sc(a...);}
void pr(){}template<class T,class...A>void pr(T t,A...a){cout<<t,pr(a...);}
#define ms(x, y) memset(x, y, sizeof(x))
#define sz(x) (int)(x.size())
#define af(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
const int mod = 1e9 + 7, base = 131;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int MM = 1e5 + 5;
int n, K, tmp, pre[205][MM], q[MM];
ll dp[MM][2], s[MM];
ll get(int j, int k, int l){
return dp[k][j] - dp[l][j] - s[k] * s[k] + s[l] * s[l];
}
int main(){
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
sc(n, K);
for (int i = 1; i <= n; i++) sc(s[i]), s[i] += s[i - 1];
for (int k = 1; k <= K; k++, tmp ^= 1){
int l = 1, r = 1;
for (int i = 1; i <= n; i++){
while(l < r && get(tmp ^ 1, q[l + 1], q[l]) >= s[i] * (s[q[l]] - s[q[l + 1]])) l++;
dp[i][tmp] = dp[q[l]][tmp ^ 1] + (s[i] - s[q[l]]) * s[q[l]];
pre[k][i] = q[l];
while(l < r && get(tmp ^ 1, q[r], q[r - 1]) * (s[q[r]] - s[i]) >= get(tmp ^ 1, i, q[r]) * (s[q[r - 1]] - s[q[r]])) r--;
q[++r] = i;
}
}
pr(dp[n][tmp ^ 1], nl);
for (int x = pre[K][n]; x; x = pre[--K][x]) pr(x, sp);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
4 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
1408 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1920 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
36 ms |
9464 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
896 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
35 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
34 ms |
6776 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
41 ms |
7288 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
27 ms |
6016 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
32 ms |
6776 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
40 ms |
8600 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
4224 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
4352 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
320 ms |
81912 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
18 ms |
4736 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
518 ms |
81400 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
310 ms |
57976 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
369 ms |
62332 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
239 ms |
51192 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
263 ms |
58232 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
337 ms |
73860 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
