# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
868274 | hungnt | Holding (COCI20_holding) | C++14 | 17 ms | 102492 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;
const int N = 102;
int n, L, R, k, s;
int a[102];
int dp[N][2505][N], Left[N][2505], Right[N][2505];
void MAX(int &A, int B)
{
if(A < B) A = B;
}
void sub2(int L)
{
int ans = 0;
for(int i = L; i <= R; i++)
for(int j = L - 1; j > 0; j--)
for(int c = 1; c <= k; c++)
{
MAX(dp[i][c][j], dp[i - 1][c][j]);
MAX(dp[i][c][j], dp[i][c][j + 1]);
if(c - i + j >= 0)
{
MAX(dp[i][c][j], dp[i - 1][c - i + j][j + 1] + a[i] - a[j]);
}
ans = max(ans, dp[i][c][j]);
}
# | 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... |