Submission #638886

#	Time	Username	Problem	Language	Result	Execution time	Memory
638886		Sofiatpc	Financial Report (JOI21_financial)	C++14	14 / 100	2589 ms	1048576 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 25;
int N,D,a[MAXN],ans;
bool marc[MAXN];

void bt(int i, int l)
{
    if(i>N)
    {
        int cur=0;

        for(int j = 1; j <= N; j++)
        {
            if(!marc[j])continue;
            bool b = false;
            for(int k = 1; k < j; k++)
                if(marc[k] && a[k]>=a[j]){b=true; break;}
            if(!b)cur++;
        }

        ans=max(ans,cur);

        return;
    }

    if(i-l<D || l==0)bt(i+1,l);

    marc[i]=true;
    bt(i+1,i);
    marc[i]=false;

    return;
}

int main()
{
    cin>>N>>D;
    for(int i = 1; i <= N; i++)cin>>a[i];

    bt(1, 0);

    cout<<ans<<"\n";
}

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