#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][maxk], 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][1] = (ps[n]-ps[i])*(ps[i]);
}
for (int j = 2; j <= k; j++) {
cht.init();
for (int i = j; i < n; i++) {
cht.update(Line(-ps[i-1], dp[i-1][j-1], i-1));
dp[i][j] = 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][k] > dp[ans][k]) ans = i;
}
vector<int> tr;
cout << dp[ans][k] << "\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 |
1 ms |
6488 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
6564 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
6496 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
6744 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
3 ms |
6632 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
6608 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
6608 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
8 ms |
6492 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
9 ms |
6684 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
8 ms |
6492 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
10 ms |
6492 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
6488 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
6492 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
6696 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
27360 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
6 ms |
27356 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
102 ms |
27612 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
5 ms |
27868 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
72 ms |
27532 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
94 ms |
27360 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
85 ms |
27868 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
83 ms |
27792 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
84 ms |
27808 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
105 ms |
27868 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
42 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |