#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>*/
#define pb push_back
#define mp make_pair
#define sz(s) ((int)(s.size()))
#define all(s) s.begin(), s.end()
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define onlycin ios_base::sync_with_stdio(false); cin.tie(0)
#define F first
#define S second
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
/*typedef tree<
pair < int, int >,
null_type,
less< pair < int, int > >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;*/
// find_by_order() order_of_key()
const int MAXN = (int)1e5+228;
const char nxtl = '\n';
const int mod = (int)1e9+7;
const double eps = (double)1e-7;
template<typename T> inline bool updmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<typename T> inline bool updmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
#define ld long double
struct line {
ll slope, delta;
int id;
line(ll _slope = 0, ll _delta = 0, int _id = 0) {
slope = _slope, delta = _delta, id = _id;
}
inline ld intersection(const line &X) const {
return (delta - X.delta - 0.0) / (X.slope - slope - 0.0);
}
inline ll get(const ll &x) {
return slope*x + delta;
}
};
vector < line > have;
int ptr = 0;
inline void addLine(const line &X) {
while(sz(have) > 1) {
ld int1 = have.back().intersection(have[sz(have)-2]);
if(X.slope == have.back().slope) {
if(X.delta >= have.back().delta) {
have.pop_back(); continue;
}
assert(0);
return;
}
ld int2 = X.intersection(have.back());
if(int2 <= int1) have.pop_back();
else break;
}
have.pb(X);
updmin(ptr, sz(have)-1);
}
inline int Find(ll x) {
while(ptr+1 < sz(have) && have[ptr].get(x) <= have[ptr+1].get(x)) ptr++;
return ptr;
}
int n, k, a[MAXN], come[202][MAXN];
ll pref[MAXN], dp[2][MAXN];
int main() {
#ifdef accepted
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
onlycin;
cin >> n >> k;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) pref[i] = pref[i-1]+a[i];
rep(i, 1, n) dp[1][i] = 0;
memset(come, 255, sizeof come);
rep(ii, 2, k+1) {
int i = ii%2;
rep(j, 1, n) dp[i][j] = -(ll)1e17;
ptr = 0;
have.clear();
addLine(line(pref[ii-1], dp[i^1][ii-1]-pref[ii-1]*pref[ii-1], ii-1));
rep(j, ii, n) {
int idd = Find(pref[j]);
dp[i][j] = have[idd].get(pref[j]);
come[ii][j] = have[idd].id;
addLine(line(pref[j], dp[i^1][j]-pref[j]*pref[j], j));
/* rep(j1, 1, j-1) {
if(updmax(dp[i][j], dp[i^1][j1] + pref[j]*pref[j1]-pref[j1]*pref[j1])) come[ii][j] = j1;
}*/
}
}
k++;
cout << dp[k&1][n] << nxtl;
vector < int > res;
int i = n;
while(come[k][i] > 0) {
res.pb(come[k][i]);
i = come[k][i];
k--;
}
sort(all(res));
for(auto &to : res) cout << to << ' ';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
79488 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
58 ms |
79580 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
57 ms |
79784 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
58 ms |
79784 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
58 ms |
79784 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
57 ms |
79784 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
58 ms |
79784 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
60 ms |
79784 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
58 ms |
79784 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
57 ms |
79784 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
58 ms |
79784 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
57 ms |
79784 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
61 ms |
79836 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
57 ms |
79836 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
57 ms |
79836 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
57 ms |
79836 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
58 ms |
79836 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
79836 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
57 ms |
79836 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
57 ms |
79836 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
57 ms |
79836 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
57 ms |
79860 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
58 ms |
79860 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
58 ms |
79860 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
59 ms |
79860 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
56 ms |
79860 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
57 ms |
79860 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
79860 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
59 ms |
79860 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
58 ms |
79860 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
58 ms |
79888 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
60 ms |
79888 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
63 ms |
79888 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
57 ms |
79888 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
58 ms |
79888 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
60 ms |
79952 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
59 ms |
79952 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
79952 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
57 ms |
79952 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
61 ms |
79952 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
57 ms |
79952 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
62 ms |
79980 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
62 ms |
79980 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
62 ms |
79980 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
61 ms |
79980 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
59 ms |
79980 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
58 ms |
79980 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
80424 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
59 ms |
80428 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
101 ms |
80684 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
59 ms |
80684 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
93 ms |
80684 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
106 ms |
80684 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
110 ms |
80684 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
86 ms |
80684 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
90 ms |
80684 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
99 ms |
80684 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
87 ms |
85724 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
76 ms |
85724 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
506 ms |
85728 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
77 ms |
85856 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
686 ms |
85856 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
455 ms |
85880 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
520 ms |
85880 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
362 ms |
85880 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
371 ms |
85880 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
485 ms |
85880 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
