#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);
//}
//
//struct Line{
// ll m, b;
// int pos;
// Line(ll slope, ll intercept, int p) {
// m = slope;
// b = intercept;
// pos = p;
// }
// ll operator () (ll x) {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];
void dnc(int l, int r, int opl, int opr, int j) {
if (l > r) return;
int mid = (l + r) >> 1;
if (mid < j) return;
ll res = LLONG_MIN;
int temp = -1;
for (int i = opl; i <= min(mid, opr); i++) {
ll cost = dpbef[i-1]+(ps[n]-ps[mid])*(ps[mid]-ps[i-1]);
if (cost > res) {
res = cost;
temp = i-1;
}
}
dp[mid] = res;
track[mid][j] = temp;
dnc(l, mid-1, opl, track[mid][j]+1, j);
dnc(mid+1, r, track[mid][j]+1, opr, j);
}
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;
// }
// }
for (int j = 2; j <= k; j++) {
swap(dp, dpbef);
dnc(1, n-1, 1, n-1, j);
}
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 |
4 ms |
5980 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
5980 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Incorrect |
2 ms |
5980 KB |
Integer 0 violates the range [1, 9] |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Incorrect |
2 ms |
5980 KB |
contestant didn't find the optimal answer: 202461680 < 302460000 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5976 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Incorrect |
2 ms |
5980 KB |
contestant didn't find the optimal answer: 211798415 < 311760000 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Incorrect |
2 ms |
5980 KB |
contestant didn't find the optimal answer: 140403179 < 140412195 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
12120 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
12124 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
76 ms |
12380 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
12380 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
64 ms |
12328 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
69 ms |
12124 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
70 ms |
12348 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
40 ms |
12348 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
59 ms |
12124 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
80 ms |
12348 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
45 ms |
81992 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
28 ms |
82264 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
840 ms |
82628 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
24 ms |
82520 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Incorrect |
1368 ms |
82396 KB |
contestant didn't find the optimal answer: 36083777381 < 36183271951 |
| 6 |
Halted |
0 ms |
0 KB |
- |
