#include <bits/stdc++.h>
#define f first
#define s second
#define N 100005
#define K 202
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
int r, e, n, k, prox[K][N], ID[N];
bool block[N];
ll A[N],B[N], dp[3][N], sum[N];
vector<pair<pii, int> > line;
void fastscan(int &number)
{
register int c;
number = 0;
c = getchar();
for (; (c>47 && c<58); c=getchar())
number = number *10 + c - 48;
}
void fast_ll(ll &number)
{
register int c;
number = 0;
c = getchar();
for (; (c>47 && c<58); c=getchar())
number = number *10 + c - 48;
}
void addline(pair<pii, int> l)
{
A[e] = l.f.f, B[e] = l.f.s, ID[e] = l.s;
while(r + 1 < e && (B[e-1] - B[e-2]) * (A[e] - A[e-1]) <= (A[e-2] - A[e-1])* (B[e-1] - B[e])) A[e-1] = A[e], B[e-1] = B[e], ID[e-1] = ID[e], e--;
e++;
}
pii query(ll x)
{
while(r + 1 < e && B[r + 1] - B[r] >= x * (A[r] - A[r + 1])) r++;
return pii(A[r]*x + B[r],ID[r]);
}
void print()
{
vector<int> res;
int pos2 = n;
for(int pos1 = k; pos1; pos1--) res.push_back(prox[pos1][pos2]), pos2 = prox[pos1][pos2];
while (!res.empty()) printf("%d ",res.back()), res.pop_back();
}
int32_t main()
{
scanf("%d %d",&n,&k);
for(int i = 1; i <= n; i++) scanf("%lld", &sum[i]), sum[i] += sum[i - 1];
for(int i = 0; i <= n; i++) dp[0][i] = 0;
int A = 0, B = 1;
for(int q = 0; q <= k; q++)
{
r = e = 0;
addline(make_pair(pii(0, 0), 0));
for (int i = 1; i <= n; i++)
{
pii x = query(sum[i]);
prox[q][i] = x.s;
dp[A][i] = x.f + sum[i]*(sum[n] - sum[i]);
addline(make_pair(pii(sum[i], dp[B][i] - sum[n]*sum[i]), i));
}
swap(A, B);
}
printf("%lld\n",dp[k%2][n]);
print();
printf("\n");
}
Compilation message
sequence.cpp: In function 'int32_t main()':
sequence.cpp:72:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&k);
^
sequence.cpp:74:77: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(int i = 1; i <= n; i++) scanf("%lld", &sum[i]), sum[i] += sum[i - 1];
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 ms |
86100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
3 ms |
86100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
86100 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
86100 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
86100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
46 ms |
86100 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
86100 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
36 ms |
86100 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
33 ms |
86100 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
36 ms |
86100 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
29 ms |
86100 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
29 ms |
86100 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
46 ms |
86100 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
86100 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
16 ms |
86100 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
496 ms |
86100 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
19 ms |
86100 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
613 ms |
86100 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
463 ms |
86100 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
416 ms |
86100 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
299 ms |
86100 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
399 ms |
86100 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
409 ms |
86100 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
