#include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 1e5+5;
struct line {
long m, b;
int idx;
line(long m, long b, int idx) : m(m), b(b), idx(idx) { }
long f(long x) { return m * x + b; }
};
struct cht {
int ptr = 0;
vector<line> l;
bool bad(line a, line b, line c) { return (c.b - a.b) * (a.m - b.m) <= (b.b - a.b) * (a.m - c.m); }
void add(long m, long b, int idx) {
line now(m, b, idx);
while(l.size() > 1 && bad(l[l.size()-2], l[l.size()-1], now))
l.pop_back();
l.emplace_back(now);
}
line query(long x) {
if(ptr >= l.size()) ptr = l.size() - 1;
while(ptr + 1 < l.size() && l[ptr].f(x) < l[ptr+1].f(x)) ++ptr;
return l[ptr];
}
void clear() { l.clear(), ptr = 0; }
} hull[2];
int n, k, pv[205][N];
long dp[N], pref[N];
int main() {
scanf("%d %d", &n, &k), ++k;
for(int i = 1; i <= n; i++) scanf("%lld", pref+i);
for(int i = 1; i <= n; i++) pref[i] += pref[i-1];
hull[0].add(0, 0, 0);
for(int j = 1; j <= k; j++) {
int now = j & 1, pre = now ^ 1;
hull[now].clear();
for(int i = j; i <= n; i++) {
line ret = hull[pre].query(pref[i]);
dp[i] = ret.f(pref[i]);
pv[j][i] = ret.idx;
hull[now].add(pref[i], dp[i] - pref[i] * pref[i], i);
}
}
vector<int> ans;
for(int j = k, i = n; j > 1; j--) ans.emplace_back(i = pv[j][i]);
reverse(ans.begin(), ans.end());
printf("%lld\n", dp[n]);
for(int i : ans) printf("%d ", i);
printf("\n");
return 0;
}
Compilation message
sequence.cpp: In member function 'line cht::query(long long int)':
sequence.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ptr >= l.size()) ptr = l.size() - 1;
~~~~^~~~~~~~~~~
sequence.cpp:28:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(ptr + 1 < l.size() && l[ptr].f(x) < l[ptr+1].f(x)) ++ptr;
~~~~~~~~^~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:38:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &k), ++k;
~~~~~~~~~~~~~~~~~~~~~~^~~~~
sequence.cpp:39:38: 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", pref+i);
~~~~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 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 |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
1536 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1820 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
41 ms |
9784 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
1404 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
43 ms |
6296 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
35 ms |
7160 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
37 ms |
7668 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
26 ms |
6524 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
31 ms |
7156 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
38 ms |
8944 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
9168 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
31 ms |
9064 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
445 ms |
85488 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
37 ms |
9576 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
642 ms |
84544 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
455 ms |
62320 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
381 ms |
66288 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
267 ms |
55132 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
337 ms |
61800 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
396 ms |
77404 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
