Submission #581531

#	Time	Username	Problem	Language	Result	Execution time	Memory
581531		colossal_pepe	Financial Report (JOI21_financial)	C++17	48 / 100	75 ms	724 KiB

Main

#include <iostream>
using namespace std;

const int N = 7005;

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> d;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        dp[i] = 1;
        int x = i;
        for (int j = i - 1; j >= max(0, x - d); j--) {
            if (a[j] >= a[i]) continue;
            x = j;
            dp[i] = max(dp[i], 1 + dp[j]);
        }
        ans = max(ans, dp[i]);
    }
    cout << ans << '\n';
    return 0;
}

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