제출 #950586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950586		VMaksimoski008	Feast (NOI19_feast)	C++14	43 / 100	100 ms	14516 KiB

feast

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

ll dp[500][500];
int n, K;
vector<int> v;

ll f(int pos, int sub) {
    if(pos == n + 1) return (sub == K ? 0 : -1e18);
    if(dp[pos][sub] != -1) return dp[pos][sub];

    ll ans = max(f(pos+1, sub), f(pos+1, sub+1));
    ll sum = 0;

    for(int i=pos; i<=n; i++) {
        sum += v[i];
        ans = max(ans, sum + f(i+1, sub+1));
    }

    return dp[pos][sub] = ans;
}

int32_t main() {
    int neg = 0;
    cin >> n >> K;

    v.resize(n+1);
    vector<ll> pref(n+1);
    for(int i=1; i<=n; i++) {
        cin >> v[i];
        neg += (v[i] < 0);
        pref[i] = pref[i-1] + v[i];
    }

    if(neg == 0) {
        cout << pref[n] << '\n';
        return 0;
    }

    if(K == 1) {
        ll ans = 0, sum = 0, mn = 0;

        for(int i=1; i<=n; i++) {
            sum += v[i];
            ans = max(ans, sum - mn);
            mn = min(mn, sum);
        }

        cout << ans << '\n';
        return 0;
    }

    memset(dp, -1, sizeof(dp));

    cout << f(1, 0) << '\n';
    return 0;
}

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