Submission #1304779

#	Time	Username	Problem	Language	Result	Execution time	Memory
1304779		BilAktauAlmansur	Financial Report (JOI21_financial)	C++20	0 / 100	4094 ms	5124 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
const int N = 3e5 + 7, M = 5e6 + 7, mod = 1e9 + 7;

int n, k, a[N], dp[N];
void solve() {
    cin>>n>>k;
    for(int i = 1; i <= n; i++) {
        cin>>a[i];
        dp[i] = 1;
    }
    int mx = 0;
    for(int i = n - 1; i >= 1; i--) {
        for(int j = i + 1; j <= min(n, i + k); j++) {
            if(a[j] > a[i]) {
                dp[i] = max(dp[i], dp[j] + 1);
            }else if(a[j] == a[i]) {
                dp[i] = max(dp[i], dp[j]);
            }
        }
        // cout << i << ' ' << dp[i] << '\n';
        mx = max(mx, dp[i]);
    }
    cout << mx << '\n';
}
signed main() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    int T = 1;
    // cin>>T;
    while(T --)solve();
}

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