# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549984 | Duy_e | Split the sequence (APIO14_sequence) | C++14 | 130 ms | 131072 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.
/*
** TASK:
** LINK:
*/
#include <bits/stdc++.h>
#define ll long long
#define pii pair<ll, ll>
#define st first
#define nd second
#define file "test"
using namespace std;
const long long INF = 1e18;
const long long N = 200 + 5;
ll n, a[N], k, dp[N][N][N], f[N], trace[N][N][N], num[N][N][N];
ll cal(int l, int r, int cur) {
if (l == r || cur == 0) return 0;
if (dp[l][r][cur] != -1) return dp[l][r][cur];
ll &ans = dp[l][r][cur];
ans = 0;
for (int i = l; i <= r; i ++) {
for (int j = 0; j <= i - l; j ++)
if (j < cur && r - i > cur - j - 1) {
ll tmp = (f[i] - f[l - 1]) * (f[r] - f[i]) + cal(l, i, j) + cal(i + 1, r, cur - j - 1);
if (tmp >= ans)
trace[l][r][cur] = i, num[l][r][cur] = j, ans = tmp;
}
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... |