제출 #1093775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093775		muhammad	Feast (NOI19_feast)	C++17	18 / 100	194 ms	262144 KiB

feast

#include <iostream>
#include <vector>
#include <algorithm>
#include <limits.h>

using namespace std;

int main() {
    int N, K;
    cin >> N >> K;

    vector<int> A(N + 1);
    for (int i = 1; i <= N; ++i) {
        cin >> A[i];
    }

    // Initialize the DP arrays
    vector<vector<long long>> f(N + 1, vector<long long>(K + 1, LLONG_MIN));
    vector<vector<long long>> g(N + 1, vector<long long>(K + 1, LLONG_MIN));

    // Base case
    f[0][0] = 0;
    g[0][0] = 0;

    // Fill DP tables
    for (int n = 1; n <= N; ++n) {
        for (int k = 0; k <= K; ++k) {
            // Calculate g(n, k)
            if (k > 0) {
                g[n][k] = max(g[n - 1][k], f[n - 1][k - 1]) + A[n];
            }
            // Calculate f(n, k)
            f[n][k] = max(f[n - 1][k], g[n][k]);
        }
    }

    // The answer is f(N, K), i.e., the maximum sum of K subarrays in the first N integers
    cout << f[N][K] << endl;

    return 0;
}

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