Submission #483754

#	Time	Username	Problem	Language	Result	Execution time	Memory
483754		duchung	Financial Report (JOI21_financial)	C++17	0 / 100	4038 ms	2628 KiB

Main

#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

#include<bits/stdc++.h>
using namespace std;

const int N = 3e5 + 5;

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

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

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