# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873302 | NintsiChkhaidze | Split the sequence (APIO14_sequence) | C++17 | 2077 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.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define s second
#define f first
#define int ll
using namespace std;
const int N = 1e5 + 3;
int a[N],p[N],dp[N][203],lst[N][203];
void get(int r,int k){
if (r < 1) dp[r][k] = 0;
if (k == 0) dp[r][k] = 0;
if (dp[r][k] != -1) return;
for (int i = 1; i < r; i++){
int s1 = p[i],s2 = p[r] - p[i];
int reward = s1*s2;
get(i,k - 1);
int cur = dp[i][k - 1] + reward;
if (cur > dp[r][k]){
dp[r][k] = cur;
lst[r][k] = i;
}
}
# | 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... |