# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1110104 | sunboi | Split the sequence (APIO14_sequence) | C++17 | 2041 ms | 16488 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 int long long
const int INF = 1e18;
signed main(){
int n, k; cin >> n >> k;
vector<int> a(n + 1), suf(n + 2);
for (int i = 1; i <= n; i++){
cin >> a[i];
}
for (int i = n; i >= 0; i--){
suf[i] = suf[i + 1] + a[i];
}
vector<vector<int>> dp(n + 10, vector<int> (k + 1, 0));
for (int i = n; i >= 1; i--){
for (int j = i + 1; j <= n; j++){
int suma = suf[i] - suf[j];
int before = suf[j];
for (int kk = 1; kk <= k; kk++){
dp[i][kk] = max(dp[i][kk], dp[j][kk - 1] + suma * before);
}
}
}
set<int> id;
# | 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... |