Submission #1320948

#	Time	Username	Problem	Language	Result	Execution time	Memory
1320948		NValchanov	Feast (NOI19_feast)	C++20	41 / 100	96 ms	58972 KiB

feast

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

typedef long long llong;

const int MAXN = 2e3 + 10;
const llong INF = 4e18 + 10;

int n, k;
llong dp[MAXN][MAXN][2];
int a[MAXN];

void read()
{
    cin >> n >> k;

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

void solve()
{
    llong ans = -INF;

    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], dp[i - 1][j - 1][0]) + a[i];
        }

        ans = max(ans, dp[n][j][0]);
        ans = max(ans, dp[n][j][1]);
    }

    cout << ans << endl;
}


int main()
{
    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