#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 1e5+10;
const lint LNF = 2e18;
int n, p;
lint S[MAX];
lint D[MAX], E[MAX];
int from[202][MAX];
struct frac{
lint a, b; // a/b , b>0
frac(lint x, lint y): a(x), b(y) {
if(b==0){ cerr<<"ERROR!!\n", exit(42); }
if(b<0) a*=-1, b*=-1;
}
frac(lint x): a(x), b(1) {}
frac(): a(1), b(1) {}
bool operator <= (const frac &f) {
return a*f.b <= f.a*b;
}
bool operator <= (lint x) {
return a <= x * b;
}
void show(){
cout<<a<<"/"<<b<<" ~= "<<(double)a/b<<endl;
}
};
struct line_t{
lint a, b; int idx;
lint eval(lint x){
return a*x + b;
}
frac operator ^ (const line_t &l) const {
return frac(l.b-b, a-l.a);
}
void show(){ cout<<a<<' '<<b<<endl; }
};
deque<line_t> Q;
/*
D[i][j]: 1~i까지 j조각 최대
D[i][j] = max(D[k][j-1] + (S[i]S[k]-S[k]^2)
= max(S[k] * S[i] + (D[k][j-1]-S[k]^2))
*/
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin>>n>>p; p++;
for(int i=1, a; i<=n; i++) cin>>a, S[i]=S[i-1]+a;
for(int i=1; i<=n; i++) D[i] = -LNF;
D[0] = 0;
for(int j=1; j<=p; j++){
Q.clear(); Q.push_back({0, D[0], 0});
E[0] = -INF;
for(int i=1; i<=n; i++){
// cout<<"Solve: "<<i<<", "<<j<<endl;
// for(line_t l:Q) l.show();
// cout<<endl;
while(Q.size() > 1U){
// a,b가 S[i] 이하이면 pop_front
line_t a = Q[0], b = Q[1];
if((a^b) <= S[i]) Q.pop_front();
else break;
}
E[i] = Q[0].eval(S[i]);
from[j][i] = Q[0].idx;
// cout<<"Midst\n";
line_t now = {S[i], D[i] - S[i]*S[i], i};
while(Q.size() > 1U){
// a,b가 now,b가 이하이면 pop_back
line_t a = Q.back(), b = Q[Q.size()-2U];
if((now^b) <= (a^b)) Q.pop_back();
else break;
}
// 만약 평행하다면, 절편이 더 큰걸로 교체
if(!Q.empty() && Q.back().a == now.a){
if(Q.back().b <= now.b)
Q.back().b = now.b, Q.back().idx = now.idx;
}
else Q.push_back(now);
}
for(int i=0; i<=n; i++) D[i] = E[i];
}
int pos = -1; lint ans = -1;
for(int i=1; i<=n; i++){
if(ans<D[i]) pos = i, ans = D[i];
}
vector<int> track;
for(int i=p; i>1; i--){
pos = from[i][pos];
track.push_back(pos);
}
cout<<ans<<'\n';
reverse(track.begin(), track.end());
for(int x:track) cout<<x<<' ';
cout<<'\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
1380 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
1920 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
2176 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
896 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
896 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
75 ms |
9520 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
1024 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
67 ms |
6008 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
58 ms |
6904 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
67 ms |
7416 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
59 ms |
6136 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
60 ms |
6992 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
93 ms |
8696 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
6236 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
28 ms |
6244 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
743 ms |
83452 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
42 ms |
6436 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
996 ms |
83384 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
681 ms |
60124 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
609 ms |
64352 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
563 ms |
53248 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
697 ms |
60212 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
707 ms |
75916 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
