제출 #581467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581467		colossal_pepe	Financial Report (JOI21_financial)	C++17	0 / 100	2236 ms	146744 KiB

Main

#include <iostream>
#include <cstring>
using namespace std;

const int N = 405;

int n, d, a[N], dp[N][N][N];
bool vis[N][N][N];

int brutus(int i, int j, int k) {
    if (i > n) return (j == n ? 0 : -1000);
    if (vis[i][j][k]) return dp[i][j][k];
    vis[i][j][k] = 1;
    if (j != 0 and i - j > d) dp[i][j][k] = -1000;
    else dp[i][j][k] = max(brutus(i + 1, j, k), (a[i] > a[k]) + brutus(i + 1, i, (a[i] > a[k] ? i : k)));
    return dp[i][j][k];
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> d;
    a[0] = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    // if (n > 400) cout << "parbona" << '\n';
    memset(vis, 0, sizeof(vis));
    cout << brutus(1, 0, 0) << '\n';
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35