Submission #1307171

#	Time	Username	Problem	Language	Result	Execution time	Memory
1307171		chithanhnguyen	Feast (NOI19_feast)	C++20	41 / 100	26 ms	30680 KiB

feast

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

#define int long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define fi first
#define se second
#define __builtin_popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) ((1ll << (x)))

#define debug(a, l, r) for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';

const int MAXN = 2005;
const int INF  = 1e18 + 7;
int n, k, a[MAXN], pref[MAXN], dp[MAXN][MAXN];

signed main() {
    #ifdef NCTHANH
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr); cout.tie(nullptr);

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


    for (int j = 1; j <= k; ++j) {
        int mx = -INF;
        for (int i = 1; i <= n; ++i) {
            dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            mx = max(mx, dp[i - 1][j - 1] - pref[i - 1]);
            dp[i][j] = max(dp[i][j], mx + pref[i]);
            // for (int pre = i; pre >= 1; --pre) {
            //     dp[i][j] = max(dp[i][j], dp[pre - 1][j - 1] + (pref[i] - pref[pre - 1]));
            // }
        }
    }

    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: 20 / 20
• Subtask 7: 0 / 29