This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e3 + 10, K = 210;
ll dp[N][K], ps[N];
int par[N][K];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k; cin >> n >> k;
++k;
for(int i=0; i<n; i++){
int x; cin >> x;
ps[i + 1] = ps[i] + x;
}
for(int j=2; j<=k; j++)
for(int i=1; i<=n; i++)
for(int c=i-1; c>=0; c--){
if(dp[i][j] <= (ps[i] - ps[c]) * ps[c] + dp[c][j - 1])
par[i][j] = c;
dp[i][j] = max(dp[i][j], (ps[i] - ps[c]) * ps[c] + dp[c][j - 1]);
}
cout << dp[n][k] << '\n';
while(k > 1){
cout << par[n][k] << ' ';
n = par[n][k];
--k;
}cout << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |