제출 #1316159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1316159		1ota	Feast (NOI19_feast)	C++20	21 / 100	1096 ms	327680 KiB

feast

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

#define endl "\n"
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define entire(x) (x).begin(), (x).end()

int32_t main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int n, k; cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    vector<vector<int>> dp(n, vector<int>(k + 1, 0));

    if (a[0] > 0) for (int i = 0; i < k; i++) dp[0][i] = a[0];

    for (int i = 1; i < n; i++) for (int j = 1; j <= k; j++){
        int last = 0; dp[i][j] = dp[i-1][j];
        for (int idx = i; idx > 0; idx--){
            last += a[idx]; dp[i][j] = max(dp[i][j], dp[idx-1][j-1] + last);
        }
    }

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

    cout << ans << endl;
    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