제출 #861137

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
861137		sleepntsheep	Feast (NOI19_feast)	C++17	21 / 100	3 ms	1128 KiB

feast

#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll=long long;

#define N 305
#define ALL(x) x.begin(), x.end()

int n, k, a[N];
long long p[N];
long long dp[N][N];

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) cin >> a[i], p[i] = p[i-1] + a[i];

    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= k; ++j)
        {
            dp[i][j] = max({dp[i-1][j], dp[i][j], dp[i][j-1]});
            for (int l = 0; l < i; ++l)
            {
                dp[i][j] = max(dp[i][j], dp[l][j-1] + p[i] - p[l]);
            }
        }
    }
    cout << dp[n][k];

    return 0;
}

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