#pragma GCC optimize("O3", "unroll-loops") // "Ofast"
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
#include <bits/stdc++.h>
//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<int> >;
const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;
int n, k, pr[N][205];
ll a[N], p[N];
vt<ll> dp(N), dp1(N);
ll cost (int l, int r) {
return (p[l - 1] * (p[r] - p[l - 1]));
}
void merge (int l, int r, int optl, int optr, int lr) {
if (l > r) return;
int mid = l + r >> 1;
ll mn = -inf;
int opt = -1;
for (int i = optl; i <= min(optr, mid); i++) {
ll x = dp[i - 1] + cost(i, mid);
if (mn <= x) mn = x, opt = i;
}
dp1[mid] = mn;
pr[mid][lr] = opt - 1;
merge(l, mid - 1, optl, opt, lr);
merge(mid + 1, r, opt, optr, lr);
}
void solve () {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i], p[i] = p[i - 1] + a[i];
for (int i = 1; i <= k; i++) {
merge(1, n, 1, n, i);
dp = dp1;
}
cout << dp[n] << '\n';
vt<int> path;
int cur = n;
while (k) {
path.pb(pr[cur][k]);
cur = pr[cur][k];
k--;
}
reverse(all(path));
for (int i: path) cout << i << ' ';
cout << '\n';
}
bool testcases = 0;
signed main() {
#ifdef ONLINE_JUDGE
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
Compilation message
sequence.cpp: In function 'void merge(int, int, int, int, int)':
sequence.cpp:35:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
35 | int mid = l + r >> 1;
| ~~^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15956 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
9 ms |
15956 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
8 ms |
15956 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
12 ms |
15956 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
17 ms |
15956 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
10 ms |
15956 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
8 ms |
15956 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
8 ms |
15956 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
10 ms |
15956 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
11 ms |
15956 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
11 ms |
15956 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
12 ms |
15960 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
13 ms |
15916 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
12 ms |
15956 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
11 ms |
15992 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
10 ms |
15976 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
11 ms |
15956 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
15936 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
9 ms |
15956 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
60 ms |
15996 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
10 ms |
15956 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
18 ms |
15956 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
15 ms |
15956 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
35 ms |
15956 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
21 ms |
16052 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
14 ms |
15956 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
22 ms |
15956 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
16084 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
11 ms |
16140 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
240 ms |
16284 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
10 ms |
16176 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
178 ms |
16204 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
201 ms |
16160 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
230 ms |
16160 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
56 ms |
16084 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
39 ms |
16064 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
70 ms |
16204 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
16724 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
11 ms |
16724 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
253 ms |
16828 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
10 ms |
16724 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
229 ms |
16816 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
196 ms |
16812 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
241 ms |
16816 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
251 ms |
16724 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
53 ms |
16724 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
100 ms |
16816 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
14 ms |
24204 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
15 ms |
24148 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
328 ms |
24232 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
16 ms |
24148 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
195 ms |
24268 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
238 ms |
24204 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
248 ms |
24264 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
206 ms |
24224 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
244 ms |
24212 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
285 ms |
24232 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
57 ms |
97812 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
59 ms |
98020 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1216 ms |
98316 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
57 ms |
98324 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1250 ms |
97996 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
900 ms |
97940 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
943 ms |
98252 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
743 ms |
98228 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
824 ms |
98160 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1063 ms |
98264 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
