Submission #654141

#	Time	Username	Problem	Language	Result	Execution time	Memory
654141		Farbod	Financial Report (JOI21_financial)	C++17	0 / 100	5 ms	468 KiB

Main

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

const int N = 7005;

int n, d, a[N], dp[N], ans = 0;

signed main()
{
    cin >> n >> d;
    for (int i = 0; i < n; i++)
        cin >> a[i];

    dp[n - 1] = 1;
    for (int i = n - 2; i >= 0; i--) {
        dp[i] = 1;

        int k = i;
        for (int j = i + 1; j < n; j++) {
            if (j - k > d)
                break;

            if (a[j] <= a[i])
                k = j;
            else
                dp[i] = max(dp[i], dp[j] + 1);
        }

        ans = max(ans, dp[i]);
    }

    cout << ans;

    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