// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 1e5 + 10, K = 210;
ll PS[N], S[N], dp[2][N]; int opt[K][N], A[N], n, k;
inline ll get(int l, int r) {
return S[r] - S[max(0, l - 1)] - (PS[r] - PS[max(0, l - 1)]) * PS[max(0, l - 1)];
}
void DC(int j, int l = 1, int r = n, int optl = 1, int optr = n) {
if (r - l < 0) return;
int mid = (l + r) >> 1;
dp[j & 1][mid] = 1e18;
for (int i = max(2, optl); i <= min(mid, optr); i++) {
ll x = get(i, mid) + dp[1 - (j & 1)][i - 1];
if (x < dp[j & 1][mid]) {
dp[j & 1][mid] = x, opt[j][mid] = i;
}
}
DC(j, l, mid - 1, optl, opt[j][mid] == -1 ? n : opt[j][mid]);
DC(j, mid + 1, r, max(1, opt[j][mid]), optr);
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &A[i]), PS[i] = PS[i - 1] + A[i];
for (int i = 1; i <= n; i++) {
S[i] = S[i - 1] + 1ll * A[i] * PS[i - 1];
}
memset(opt, -1, sizeof opt);
for (int i = 0; i <= n; i++) dp[1][i] = S[i];
for (int i = 2; i <= k + 1; i++) {
DC(i);
}
printf("%lld\n", S[n] - dp[1 - (k & 1)][n]);
int id = n; vector<int> vec;
for (int i = k + 1; i > 1; i--) {
if (opt[i][id] == -1) { cout << to_string(k); break; }
vec.push_back(id = opt[i][id] - 1);
}
reverse(vec.begin(), vec.end());
for (int &i : vec) printf("%d ", i);
printf("\n");
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
35 | scanf("%d%d", &n, &k);
| ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:36:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
36 | for (int i = 1; i <= n; i++) scanf("%d", &A[i]), PS[i] = PS[i - 1] + A[i];
| ~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
45 ms |
82560 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
45 ms |
82668 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
45 ms |
82668 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
46 ms |
82668 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
46 ms |
82668 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
49 ms |
82540 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
48 ms |
82540 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
48 ms |
82540 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
52 ms |
82668 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
45 ms |
82540 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
56 ms |
82540 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
46 ms |
82540 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
59 ms |
82540 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
56 ms |
82540 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
58 ms |
82668 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
56 ms |
82560 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
47 ms |
82540 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
51 ms |
82668 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
50 ms |
82924 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
48 ms |
82924 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
156 ms |
82924 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
48 ms |
82924 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
145 ms |
82924 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
145 ms |
82924 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
142 ms |
83052 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
119 ms |
82924 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
166 ms |
82924 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
168 ms |
82924 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
82 ms |
86124 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
82 ms |
86380 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1251 ms |
86664 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
79 ms |
86636 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1965 ms |
86288 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1284 ms |
86292 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1240 ms |
86532 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
942 ms |
86464 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1292 ms |
86380 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1409 ms |
86380 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
