제출 #1321311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1321311		serkanrashid	Feast (NOI19_feast)	C++20	41 / 100	792 ms	59036 KiB

feast

#include <bits/stdc++.h>
#define endl "\n"

using namespace std;

const int MAXN = 2000+5;
int n,k;
long long a[MAXN];

void read()
{
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> a[i];
}

long long dp[MAXN][MAXN][2];

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

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	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