#include <bits/stdc++.h>
#define int long long
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define Scan(a) scanf ("%I64d", &a)
#define scan(a) scanf ("%d", &a)
#define pi pair < long long, long long >
using namespace std;
const long long INF = (int)1e18 + 7;
const int N = (int)100007;
const int mod = 1000000007;
int n, k, arr[N], pr[N], par[100007][207];
int dp[N][207];
int calc(int l,int r){
return pr[l] * (pr[r] - pr[l]);
}
void solve(int k,int l,int r,int optl,int optr){
if(l > r){
return;
}
int mid = (l + r) >> 1;
int opt = optl;
dp[mid][k] = 0;
for(int i = optl;i <= min(mid,optr); i++){
int cur = dp[i][k - 1] + calc(i,mid);
if(cur >= dp[mid][k]){
dp[mid][k] = cur;
opt = i;
}
}
par[mid][k] = opt;
solve(k,l,mid - 1,optl,opt);
solve(k,mid + 1,r,opt,optr);
}
main(){
cin >> n >> k;
for(int i = 1;i <= n; i++){
cin >> arr[i];
pr[i] = pr[i - 1] + arr[i];
}
for(int i = 1;i <= k; i++){
solve(i,1,n,1,n);
}
cout << dp[n][k] << '\n';
vector<int > ans;
while(par[n][k]){
ans.pb(par[n][k]);
n = par[n][k];
k--;
}
for(int i = ans.size() - 1; i >= 0; i--){
cout << ans[i] << " ";
}
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp:43:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
3 ms |
384 KB |
Integer 2 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
4 ms |
1024 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
3 ms |
1024 KB |
Integer 200 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
3584 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
3584 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
3584 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
3584 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
3712 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
3584 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
20 ms |
3584 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
18 ms |
3584 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
3584 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
10 ms |
3584 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
40 ms |
32872 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
43 ms |
32960 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
195 ms |
33104 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
38 ms |
32888 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
157 ms |
32860 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
159 ms |
33016 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
156 ms |
33020 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
152 ms |
33016 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
134 ms |
32972 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
202 ms |
32968 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
150 ms |
132096 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
