#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dou;
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
//const ll mod = 1e9+7;
bool maximize(ll &x, ll y ){
if (x < y) {x = y; return true;};
return false;
}
bool minimize(ll &x, ll y){
if (x > y) {x = y; return true;}
return false;
}
//void add(ll &x, ll y ){
// x += y;
// if (x >= mod) x -= mod;
//}
//void sub(ll &x, ll y) {
// x -= y;
// if (x < 0) x += mod;
//}
ll divi(ll x, ll y ){
if (x == 0 || y == 0) return 0;
return x/y - ((x^y)<0&&x%y);
}
int temp;
struct Line{
ll m, b;
int pos;
Line(ll slope, ll intercept, int p) {
m = slope;
b = intercept;
pos = p;
}
ll operator () (ll x) {temp = pos; return m*x+b;}
friend ll inter(Line a, Line b){
return divi(b.b-a.b, a.m-b.m);
}
};
struct CHT{
vector<pair<Line, ll>> hull;
void init() {
hull.clear();
}
void update(Line a) {
while (!hull.empty() && hull.back().se <= (inter(hull.back().fi, a))) {
hull.pop_back();
}
if (hull.empty()) {
hull.push_back(make_pair(a, LLONG_MAX));
return;
}
hull.push_back(make_pair(a, inter(a, hull.back().fi)));
}
ll query(ll x) {
int pos = 0;
for (int k = hull.size()/2; k > 0; k >>= 1) {
while (pos+k < (int)hull.size() && hull[pos+k].se >= x) pos += k;
}
return hull[pos].fi(x);
}
} cht;
const int maxn = 1e5+3, maxk = 202;
int n, k;
ll dp[maxn], dpbef[maxn], ps[maxn];
int track[maxn][maxk], a[maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
ps[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
ps[i] = ps[i-1] + a[i];
}
for (int i = 1; i < n; i++) {
dp[i] = (ps[n]-ps[i])*(ps[i]);
}
for (int j = 2; j <= k; j++) {
cht.init();
swap(dp, dpbef);
for (int i = j; i < n; i++) {
cht.update(Line(-ps[i-1], dpbef[i-1], i-1));
dp[i] = ps[i]*(ps[n]-ps[i])+cht.query(ps[n]-ps[i]);
track[i][j] = temp;
}
}
int ans = k;
for (int i = k; i < n; i++){
if (dp[i] > dp[ans]) ans = i;
}
vector<int> tr;
cout << dp[ans] << "\n";
tr.pb(ans);
while (k > 1) {
ans = track[ans][k];
--k;
tr.push_back(ans);
}
for (int i = (int)tr.size()-1; i >= 0; i--) {
cout << tr[i] << ' ';
}
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
6232 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
5976 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
5976 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5976 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
5976 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
5980 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
5976 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5976 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
15 ms |
5976 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
11 ms |
5980 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
14 ms |
6232 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
19 ms |
6144 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
5980 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
6096 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
5976 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
22 ms |
6176 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
23 ms |
5980 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
20 ms |
5976 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
23 ms |
5980 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
21 ms |
5980 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
5976 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
12 ms |
5980 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
12508 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
12508 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
111 ms |
12768 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
12764 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
82 ms |
12512 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
100 ms |
12512 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
90 ms |
12768 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
87 ms |
12764 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
85 ms |
12768 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
120 ms |
12768 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
48 ms |
84652 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
38 ms |
84720 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1216 ms |
85704 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
38 ms |
85704 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1270 ms |
84936 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1089 ms |
84776 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
934 ms |
85704 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
907 ms |
85700 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
892 ms |
85348 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1161 ms |
85532 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
