Submission #1319326

#	Time	Username	Problem	Language	Result	Execution time	Memory
1319326		simona1230	Feast (NOI19_feast)	C++20	41 / 100	31 ms	59212 KiB

feast

#include <bits/stdc++.h>

using namespace std;
long long n,k,a[200001];
long long dp[2001][2001][2];
void read()
{
    cin>>n>>k;
    for(long long i=1;i<=n;i++)
        cin>>a[i];
}

void solve()
{
    for(long long i=0;i<=n;i++)
    {
        for(long long j=0;j<=k;j++)
        {
            dp[i][j][0]=dp[i][j][1]=-1e18;
        }
    }

    dp[0][0][0]=0;

    for(long long i=1;i<=n;i++)
    {
        for(long long j=0;j<=k;j++)
        {
            dp[i][j][0]=max(dp[i-1][j][0],dp[i-1][j][1]);
            if(j)
            {
                dp[i][j][1]=max(dp[i-1][j-1][1],dp[i-1][j-1][0])+a[i];
                dp[i][j][1]=max(dp[i][j][1],dp[i-1][j][1]+a[i]);
            }
            //cout<<i<<" "<<j<<" "<<dp[i][j][0]<<" "<<dp[i][j][1]<<endl;
        }
    }

    long long ans=0;
    for(int i=0;i<=k;i++)
        ans=max(ans,max(dp[n][i][0],dp[n][i][1]));

    cout<<ans<<endl;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	read();
	solve();
	return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 18
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 20 / 20
• Subtask 7: 0 / 29