#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,k,a[100005];
vector <ll> dp[205];
int last[100005][205];
vector <ll> M,B,ID;
bool check(int id){
return (B[id] - B[id-2]) * (M[id-2] - M[id-1]) <= (B[id-1] - B[id-2]) * (M[id-2] - M[id]);
}
void add_line(ll slope,ll val,ll id){
M.push_back(slope);
B.push_back(val);
ID.push_back(id);
while(M.size() >= 2 && M[M.size()-2] == M[M.size()-1]){
if (B[M.size()-2] <= B[M.size()-1]){
M.erase(M.end()-2);
B.erase(B.end()-2);
ID.erase(ID.end()-2);
}
else{
M.erase(M.end()-1);
B.erase(B.end()-1);
ID.erase(ID.end()-1);
}
}
while(M.size() >= 3 && check(M.size()-1)) ID.erase(ID.end()-2), M.erase(M.end()-2), B.erase(B.end()-2);
}
int ctrl;
ll get(ll x){
ctrl = min(ctrl, (int)M.size()-1);
while(ctrl < M.size()-1 && M[ctrl] * x + B[ctrl] <= M[ctrl+1] * x + B[ctrl+1])
++ctrl;
return ctrl;
}
int main(){
scanf("%d %d",&n,&k);
k++;
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),
a[i] += a[i-1];
dp[0].assign(n+5,-(ll) 1e18);
dp[0][0] = 0;
for(int t=1;t<=k;t++){
M.clear(); B.clear(); ID.clear();
add_line(0,0,0);
if (t >= 2) dp[t-2].clear();
dp[t].assign(n+5,0);
for(int i=1;i<=n;i++){
int id = get(a[i]);
dp[t][i] = M[id] * a[i] + B[id];
last[i][t] = ID[id];
add_line(a[i], dp[t-1][i] - 1ll * a[i] * a[i], i);
}
}
vector <int> res;
int mjk = n;
for(int t=k;t>1;t--){
res.push_back(last[mjk][t]);
mjk = last[mjk][t];
}
reverse(res.begin(),res.end());
printf("%lld\n",dp[k][n]);
for(int i=0;i<res.size();i++) printf("%d ",res[i]);
//cout << endl; for(int i=0;i<res.size();i++) cout << dp[i+1][res[i]] << ' ';
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'long long int get(long long int)':
sequence.cpp:32:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(ctrl < M.size()-1 && M[ctrl] * x + B[ctrl] <= M[ctrl+1] * x + B[ctrl+1])
^
sequence.cpp: In function 'int main()':
sequence.cpp:64:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<res.size();i++) printf("%d ",res[i]);
^
sequence.cpp:37:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&k);
^
sequence.cpp:41:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
a[i] += a[i-1];
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
82896 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
82500 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
82764 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
82764 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
82896 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
82632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
82632 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
82632 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
82632 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
82632 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
84100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
82632 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
84100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
83836 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
84100 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
84100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
82900 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
83168 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
83144 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
83144 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
103 ms |
98804 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
83328 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
59 ms |
92368 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
79 ms |
93932 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
73 ms |
94896 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
59 ms |
92708 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
49 ms |
94116 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
79 ms |
97240 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
63 ms |
89580 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
69 ms |
89580 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Memory limit exceeded |
779 ms |
131072 KB |
Memory limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
