oj.uz

답안 #870824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
870824 2023-11-09T08:36:50 Z hungnt Holding (COCI20_holding) C++14
110 / 110
 45 ms 110428 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 105;

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;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> n >> L >> R >> k;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = L; i <= R; i++) s += a[i];
    k = min(k, n * n / 4 + 2);
    int ans = 0;
    for(int i = L; i <= R; i++)
        for(int j = L - 1; j > 0; j--)
            for(int c = 0; 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]);
            }
    for(int i = L; i <= R; i++)
        for(int j = 0; j <= k; j++)
            Left[i][j] = dp[i][j][1];
    memset(dp, 0, sizeof dp);
    for(int i = R; i >= L; i--)
        for(int j = R + 1; j <= n; j++)
        {
            for(int c = 0; 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 - j + i][j - 1] + a[i] - a[j]);
            }
        }
    for(int i = R; i >= L; i--)
        for(int j = 1; j <= k; j++)
            Right[i][j] = dp[i][j][n];
    for(int i = L - 1; i <= R; i++)
        for(int j = 0; j <= k; j++)
            MAX(ans, Left[i][j] + Right[i + 1][k - j]);
    cout << s - ans;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 110164 KB Output is correct
2 Correct 17 ms 110424 KB Output is correct
3 Correct 16 ms 110428 KB Output is correct
4 Correct 17 ms 110392 KB Output is correct
5 Correct 17 ms 110424 KB Output is correct
6 Correct 17 ms 110428 KB Output is correct
7 Correct 15 ms 110424 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 110164 KB Output is correct
2 Correct 17 ms 110424 KB Output is correct
3 Correct 16 ms 110428 KB Output is correct
4 Correct 17 ms 110392 KB Output is correct
5 Correct 17 ms 110424 KB Output is correct
6 Correct 17 ms 110428 KB Output is correct
7 Correct 15 ms 110424 KB Output is correct
8 Correct 17 ms 110176 KB Output is correct
9 Correct 18 ms 110424 KB Output is correct
10 Correct 21 ms 110172 KB Output is correct
11 Correct 23 ms 110172 KB Output is correct
12 Correct 24 ms 110420 KB Output is correct
13 Correct 22 ms 110164 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 110164 KB Output is correct
2 Correct 17 ms 110424 KB Output is correct
3 Correct 16 ms 110428 KB Output is correct
4 Correct 17 ms 110392 KB Output is correct
5 Correct 17 ms 110424 KB Output is correct
6 Correct 17 ms 110428 KB Output is correct
7 Correct 15 ms 110424 KB Output is correct
8 Correct 17 ms 110176 KB Output is correct
9 Correct 18 ms 110424 KB Output is correct
10 Correct 21 ms 110172 KB Output is correct
11 Correct 23 ms 110172 KB Output is correct
12 Correct 24 ms 110420 KB Output is correct
13 Correct 22 ms 110164 KB Output is correct
14 Correct 21 ms 110380 KB Output is correct
15 Correct 17 ms 110168 KB Output is correct
16 Correct 15 ms 110428 KB Output is correct
17 Correct 18 ms 110160 KB Output is correct
18 Correct 18 ms 110172 KB Output is correct
19 Correct 23 ms 110164 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 110164 KB Output is correct
2 Correct 17 ms 110424 KB Output is correct
3 Correct 16 ms 110428 KB Output is correct
4 Correct 17 ms 110392 KB Output is correct
5 Correct 17 ms 110424 KB Output is correct
6 Correct 17 ms 110428 KB Output is correct
7 Correct 15 ms 110424 KB Output is correct
8 Correct 17 ms 110176 KB Output is correct
9 Correct 18 ms 110424 KB Output is correct
10 Correct 21 ms 110172 KB Output is correct
11 Correct 23 ms 110172 KB Output is correct
12 Correct 24 ms 110420 KB Output is correct
13 Correct 22 ms 110164 KB Output is correct
14 Correct 21 ms 110380 KB Output is correct
15 Correct 17 ms 110168 KB Output is correct
16 Correct 15 ms 110428 KB Output is correct
17 Correct 18 ms 110160 KB Output is correct
18 Correct 18 ms 110172 KB Output is correct
19 Correct 23 ms 110164 KB Output is correct
20 Correct 18 ms 110424 KB Output is correct
21 Correct 17 ms 110172 KB Output is correct
22 Correct 17 ms 110424 KB Output is correct
23 Correct 16 ms 110428 KB Output is correct
24 Correct 36 ms 110424 KB Output is correct
25 Correct 45 ms 110160 KB Output is correct