# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286519 | BeanZ | Split the sequence (APIO14_sequence) | C++14 | 1836 ms | 83192 KiB |
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>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
ll dp[N][2];
int opt[N][205];
int a[N];
void DP(int k, int l, int r, int optl, int optr){
if (l > r) return;
int mid = (l + r) >> 1;
dp[mid][1] = -1e18;
int best = optl;
for (int i = optl; i <= min(mid - 1, optr); i++){
if (dp[mid][1] <= (dp[i][0] + 1ll * a[i] * (a[mid] - a[i]))){
dp[mid][1] = dp[i][0] + 1ll * a[i] * (a[mid] - a[i]);
best = i;
opt[mid][k] = i;
}
}
DP(k, l, mid - 1, optl, best);
DP(k, mid + 1, r, best, optr);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("VietCT.INP", "r")){
freopen("VietCT.INP", "r", stdin);
freopen("VietCT.OUT", "w", stdout);
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i], a[i] = a[i] + a[i - 1];
for (int i = 1; i <= k; i++){
DP(i, 1, n, 1, n);
for (int j = 1; j <= n; j++){
dp[j][0] = dp[j][1];
}
}
cout << dp[n][1] << endl;
for (int i = k; i >= 1; i--){
cout << opt[n][i] << " ";
n = opt[n][i];
}
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message (stderr)
# | 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... |