#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100005;
const int K = 202;
LL div_(LL a, LL b) {
return a / b - ((a ^ b) < 0 && a % b);
}
struct line_t {
LL k, m;
int i;
line_t() {}
line_t(LL k_, LL m_, int i_) : k(k_), m(m_), i(i_) {}
LL operator() (LL x) const {
return k * x + m;
}
};
struct cht {
int n, p;
line_t L[N];
void init() {
n = p = 0;
}
bool bad(const line_t& a, const line_t& b, const line_t& c) {
if(b.k == c.k) return b.m >= c.m;
return div_(b.m - a.m, a.k - b.k) >= div_(c.m - b.m, b.k - c.k);
}
void insert(LL k, LL m, int i) {
line_t nw(k, m, i);
while(n > 1 && bad(L[n - 2], L[n - 1], nw)) --n;
if(n == 0 || L[n - 1].k != nw.k) L[n++] = nw;
}
line_t query(LL x) {
if(p >= n) p = n - 1;
while(p + 1 < n && L[p](x) > L[p + 1](x)) ++p;
return L[p];
}
} S;
int n, kk, s[N], trc[K][N];
LL f[N], g[N];
int main() {
scanf("%d %d", &n, &kk);
for(int i = 1; i <= n; ++i) {
int a;
scanf("%d", &a);
s[i] = s[i - 1] + a;
}
memset(f, 0, sizeof(f));
for(int t = 1; t <= kk; ++t) {
memcpy(g, f, sizeof(g));
memset(f, 0, sizeof(f));
S.init();
for(int i = t + 1; i <= n; ++i) {
S.insert(-s[i - 1], (LL)s[i - 1] * s[i - 1] - g[i - 1], i - 1);
line_t tmp = S.query(s[i]);
f[i] = -tmp(s[i]);
trc[t][i] = tmp.i;
}
}
printf("%lld\n", f[n]);
for(int i = n; (i = trc[kk--][i]); ) {
printf("%d ", i);
}
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
49 | scanf("%d %d", &n, &kk);
| ~~~~~^~~~~~~~~~~~~~~~~~
sequence.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
52 | scanf("%d", &a);
| ~~~~~^~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
5 ms |
2084 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
1940 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
16 ms |
2916 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
9 ms |
2544 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
11 ms |
2772 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
13 ms |
2900 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
3 ms |
2004 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
16 ms |
3476 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
16 ms |
3532 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
15 ms |
3384 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
16 ms |
3544 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
18 ms |
3540 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
4 ms |
2260 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
9 ms |
2572 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
54 ms |
10748 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
2260 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
40 ms |
7320 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
48 ms |
8104 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
49 ms |
8576 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
47 ms |
7372 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
44 ms |
8116 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
51 ms |
9908 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
5188 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
16 ms |
5320 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
520 ms |
82900 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
24 ms |
5656 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
526 ms |
82408 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
406 ms |
58888 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
395 ms |
63224 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
344 ms |
52288 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
320 ms |
59236 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
509 ms |
74780 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |