Submission #1046612

#	Time	Username	Problem	Language	Result	Execution time	Memory
1046612		vanea	Split the sequence (APIO14_sequence)	C++14	0 / 100	15 ms	12940 KiB

sequence

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

int main()
{
    int n, k;
    cin >> n >> k;
    vector<ll> v(n+1);
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    vector<ll> pref(n+1), suf(n+2);
    for(int i = 1; i <= n; i++) {
        pref[i] = pref[i-1]+v[i];
    }
    for(int i = n; i>=1; i--) {
        suf[i] = suf[i+1]+v[i];
    }
    vector<vector<array<ll, 2>>> dp(n+1, vector<array<ll, 2>>(k+1));
    ll ans = 0;
    for(int i = 1; i < n; i++) {
        for(int j = 1; j <= min(k, i); j++) {
            array<ll, 2> f = dp[i-1][j]; f[1]+=v[i];
            array<ll, 2> s = dp[i-1][j-1];
            s[1] += v[i]; s[0] += (s[1] * suf[i+1]); s[1] = 0;
            dp[i][j] = max(f, s);
            ans = max(ans, dp[i][j][0]);
        }
    }
    cout << ans;
    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29