#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
const int N = 1e5+1;
const int K = 201;
const ll INF = 3e18+100;
struct line {
int m;
ll c;
int i;
ll eval(ll x) {return 1ll*m*x+1ll*c;}
pii interX(line l) {
return {(c-l.c), (l.m-m)};
}
};
bool cmp(pii a, pii b) {
return 0 <= 1ll*b.first*a.second-1ll*a.first*b.second;
}
ll p[N], dp[2][N];
int par[K][N], n, k, a[N], l=N, r=N;
line dq[3*N];
void fs(int &number) {
register int c;
number = 0;
c = getchar();
for (; (c>47 && c<58); c=getchar()) number = number *10 + c - 48;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
fs(n), fs(k);
for (int i=1; i<=n; ++i) {
fs(a[i]);
p[i]=p[i-1]+a[i];
}
for (int j=1; j<=k; ++j) {
dq[r++]=line{0, 0, 0};
for (int i=1; i<=n; ++i) {
while (r-l >= 2) {
line a=dq[r-1], b=dq[r-2];
if (a.eval(p[i]) <= b.eval(p[i])) --r;
else break;
}
line ln=dq[r-1];
dp[j&1][i]=ln.eval(p[i]), par[j][i]=ln.i;
line cr={p[i], dp[(j-1)&1][i]-p[i]*p[i], i};
while (r-l >= 2) {
line a=dq[l], b=dq[l+1];
if (cmp(cr.interX(a), a.interX(b))) ++l;
else break;
} dq[--l]=cr;
} l=N, r=N;
}
printf("%lld\n", dp[k&1][n]);
int i=n, x=k;
while (x > 0) {
printf("%d ", par[x][i]);
i=par[x][i], --x;
} printf("\n");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:64:25: warning: narrowing conversion of 'p[i]' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
64 | line cr={p[i], dp[(j-1)&1][i]-p[i]*p[i], i};
| ~~~^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
8668 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
7000 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
22876 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
14684 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
10588 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
9 ms |
80476 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
59992 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
8 ms |
74332 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
10 ms |
80584 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
21012 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
14684 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
27096 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
80504 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
80404 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
70236 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
80488 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
80476 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
20828 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
35592 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
8796 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
8936 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
23 ms |
82804 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
8796 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
22 ms |
54076 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
24 ms |
62296 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
26 ms |
66396 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
17 ms |
54036 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
22 ms |
62244 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
27 ms |
76612 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
11100 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
7 ms |
11100 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
142 ms |
87268 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
6 ms |
11612 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
294 ms |
86612 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
180 ms |
64516 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
200 ms |
69064 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
129 ms |
56644 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
139 ms |
64596 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
184 ms |
81076 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
