// Copyright © 2022 Youngmin Park. All rights reserved.
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#pragma region TEMPLATE
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
const ld PI = acos((ld)-1.0);
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
constexpr bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
constexpr bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); } // divide a by b rounded down
#ifdef LOCAL
#include "miscellaneous/debug.h"
#else
#define dbg(...) 42
#endif
inline namespace RecursiveLambda {
template <typename Fun>
struct y_combinator_result {
Fun fun_;
template <typename T>
explicit constexpr y_combinator_result(T &&fun) : fun_(forward<T>(fun)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return fun_(ref(*this), forward<Args>(args)...);
}
};
template <typename Fun>
decltype(auto) y_combinator(Fun &&fun) {
return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun));
}
};
#pragma endregion TEMPLATE
struct Line {
ll m, b;
int ind;
ld isect(const Line& other) const {
return (ld)(b - other.b) / (other.m - m);
}
ll eval(ll x) { return m * x + b; };
};
int par[201][100'001];
void solve() {
int n, k;
cin >> n >> k;
vl pref(n), dp(n);
for (int i = 0; i < n; i++) {
cin >> pref[i];
if (i) pref[i] += pref[i - 1];
}
for (int x = 1; x <= k; x++) {
vl nxt(n, -LINF);
deque<Line> hull;
for (int i = 0; i < n; i++) {
if (dp[i] == -LINF) continue;
while (sz(hull) > 1 && hull[0].eval(pref[i]) <= hull[1].eval(pref[i])) {
hull.pop_front();
}
if (sz(hull)) {
nxt[i] = hull[0].eval(pref[i]);
par[x][i] = hull[0].ind;
}
Line l{pref[i], dp[i] - pref[i] * pref[i], i};
while (sz(hull) > 1 && end(hull)[-2].isect(l) <= end(hull)[-2].isect(end(hull)[-1])) {
hull.pop_back();
}
hull.pb(l);
}
dbg(nxt);
swap(dp, nxt);
}
cout << dp[n - 1] << '\n';
vi res;
int cnt = k, pos = n - 1;
while (true) {
if (pos != n - 1) res.pb(pos);
if (cnt == 0) break;
pos = par[cnt][pos];
cnt--;
}
reverse(all(res));
for (int i = 0; i < k; i++) cout << res[i] + 1 << " \n"[i == k - 1];
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int testcase = 1;
// cin >> testcase;
while (testcase--) {
solve();
}
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * (double)clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
Compilation message
sequence.cpp:7: warning: ignoring '#pragma region TEMPLATE' [-Wunknown-pragmas]
7 | #pragma region TEMPLATE
|
sequence.cpp:66: warning: ignoring '#pragma endregion TEMPLATE' [-Wunknown-pragmas]
66 | #pragma endregion TEMPLATE
|
sequence.cpp: In function 'void solve()':
sequence.cpp:46:18: warning: statement has no effect [-Wunused-value]
46 | #define dbg(...) 42
| ^~
sequence.cpp:105:9: note: in expansion of macro 'dbg'
105 | dbg(nxt);
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
1364 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
980 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
1888 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1932 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1696 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
1900 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2016 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
608 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
992 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
736 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
808 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
52 ms |
9288 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
736 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
43 ms |
5936 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
48 ms |
6768 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
62 ms |
7212 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
36 ms |
5976 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
44 ms |
6808 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
58 ms |
8452 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
4360 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
17 ms |
4368 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
527 ms |
81860 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
18 ms |
4704 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
692 ms |
81780 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
470 ms |
58048 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
494 ms |
62416 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
371 ms |
51424 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
415 ms |
58396 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
536 ms |
74052 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
