#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
struct Cht{
struct Line{
ll a, b; int x;
};
double cr(Line p, Line q){
return (q.b - p.b) * 1.0 / (p.a - q.a);
}
Line dq[100010];
int f, r;
void clr(){ f = r = 0; }
void upd(ll a, ll b, int x){
Line cur = {a, b, x};
while(f + 1 < r && ((dq[r - 1].a == cur.a && dq[r - 1].b <= cur.b) ||
(dq[r - 1].a != cur.a && cr(dq[r - 2], cur) <= cr(dq[r - 2], dq[r - 1])))) r--;
if(f == r || dq[r - 1].a != cur.a) dq[r++] = cur;
}
pli query(ll x){
while(f + 1 < r && x >= cr(dq[f], dq[f + 1])) f++;
return {dq[f].a * x + dq[f].b, dq[f].x};
}
}C;
int n, k, b[210][100010];
ll s[100010], dp[2][100010];
void btk(int x, int y){
if(!x) return;
btk(x - 1, b[x][y]);
printf("%d ", b[x][y]);
}
int main(){
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; i++){
scanf("%lld", s + i);
s[i] += s[i - 1];
}
for(int i = 1; i <= n; i++) dp[0][i] = s[i] * (s[n] - s[i]);
for(int i = 1, f = 1; i <= k; i++, f = !f){
C.clr();
C.upd(s[i], dp[!f][i], i);
for(int j = i + 1; j <= n; j++){
ll t = s[n] - s[j];
pli q = C.query(-t);
dp[f][j] = q.first + t * s[j];
b[i][j] = q.second;
C.upd(s[j], dp[!f][j], j);
}
}
printf("%lld\n", dp[k % 2][n]);
btk(k, n);
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:38:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &k);
^
sequence.cpp:40:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", s + i);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
88748 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
3 ms |
88748 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
88748 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
88748 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
23 ms |
88748 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
88748 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
39 ms |
88748 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
39 ms |
88748 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
43 ms |
88748 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
29 ms |
88748 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
26 ms |
88748 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
39 ms |
88748 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
88748 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
16 ms |
88748 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
349 ms |
88748 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
13 ms |
88748 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
613 ms |
88748 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
383 ms |
88748 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
449 ms |
88748 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
303 ms |
88748 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
293 ms |
88748 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
389 ms |
88748 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
