/*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left224
#define right right224
#define next next224
#define rank rank224
#define prev prev224
#define y1 y1224
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
const string FILENAME = "input";
const int MAXN = 100228;
using ll = long long;
struct Line
{
ll k, b;
int id;
Line(){}
Line(ll _k, ll _b, int _id): k(_k), b(_b), id(_id){}
ll value(ll x) {
return k * x + b;
}
};
bool better(Line a, Line b, Line c) {
return (__int128)(c.b - a.b) * (a.k - b.k) <= (__int128)(b.b - a.b) * (a.k - c.k);
}
int n, k;
int a[MAXN];
ll pref[MAXN];
ll dp[2][MAXN];
int pr[205][MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//read(FILENAME);
cin >> n >> k;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum *= sum;
for (int i = 0; i < n; i++) {
pref[i] = a[i];
if (i) {
pref[i] += pref[i - 1];
}
}
int g = 0;
for (int i = 1; i <= k + 1; i++) {
vector<Line> st;
int uk = 0;
for (int j = 0; j < n; j++) {
if (i == 1) {
dp[g][j] = pref[j] * pref[j];
} else {
if (st.empty()) {
dp[g][j] = 3e18;
} else {
while (uk + 1 < sz(st) && st[uk + 1].value(pref[j]) >= st[uk].value(pref[j])) {
uk++;
}
dp[g][j] = -st[uk].value(pref[j]) + pref[j] * pref[j];
pr[i][j] = st[uk].id;
}
Line k(2 * pref[j], -(dp[g ^ 1][j] + pref[j] * pref[j]), j);
while (sz(st) >= 2 && better(st[sz(st) - 2], st.back(), k)) {
st.pop_back();
}
chkmin(uk, sz(st) - 1);
st.pb(k);
chkmax(uk, 0);
}
}
g ^= 1;
}
cout << (sum - dp[g ^ 1][n - 1]) / 2 << '\n';
int cur = n - 1;
vector<int> st;
for (int j = k + 1; j > 1; j--) {
cur = pr[j][cur];
st.pb(cur + 1);
}
reverse(all(st));
for (auto x: st) {
cout << x << ' ';
}
cout << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
408 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
1528 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1400 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1404 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
760 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2168 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
1944 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2168 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2168 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
760 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1140 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1052 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
108 ms |
9948 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
1420 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
59 ms |
6252 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
60 ms |
7056 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
91 ms |
7928 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
70 ms |
6596 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
79 ms |
7556 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
101 ms |
9052 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
9172 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
29 ms |
9080 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1103 ms |
87712 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
32 ms |
10224 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1255 ms |
86864 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
431 ms |
61176 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
958 ms |
67900 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
745 ms |
56632 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
815 ms |
63636 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1039 ms |
79292 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
