Submission #737134

#	Time	Username	Problem	Language	Result	Execution time	Memory
737134		alexdd	Financial Report (JOI21_financial)	C++17	48 / 100	4069 ms	5536 KiB

Main

#include<bits/stdc++.h>
using namespace std;
int n,d;
int a[300005];
int dp[300005];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin>>n>>d;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    int rez=0;
    for(int i=1;i<=n;i++)
    {
        int mxm=0,ult=i;
        for(int x=i-1;x>0;x--)
        {
            if(ult-x > d)
                break;
            if(a[x]<a[i])
            {
                mxm = max(mxm, dp[x]);
                ult = x;
            }
        }
        dp[i]=mxm+1;
        rez=max(rez,dp[i]);
    }
    cout<<rez;
    return 0;
}
/**

dp[i] = scorul maxim care se poate obtine daca ultimul element care creste scorul se afla pe pozitia i

dp[i] = max(dp[x]) + 1,  a[x] < a[i], distanta dintre oricare 2 pozitii consecutive cu numere < a[i] este maxim d

*/

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