Submission #472069

#	Time	Username	Problem	Language	Result	Execution time	Memory
472069		jalsol	Split the sequence (APIO14_sequence)	C++17	33 / 100	13 ms	916 KiB

sequence

// looking to shine brighter in this world...

#define TASK "sequence"

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 200 + 5;

int n, k;
int a[maxn];
ll pref[maxn];

ll dp[maxn][maxn];
int trace[maxn][maxn];

ll sum(int l, int r) {
    if (l > r) return 0;
    return pref[r] - pref[l - 1];
}

ll go(int i, int rem) {
    if (i == n + 1 || rem == 0) return 0;

    ll& ret = dp[i][rem];
    if (ret != -1) return ret;

    ret = -1;

    For (j, i, n) {
        ll cost = go(j + 1, rem - 1) + sum(i, j) * sum(j + 1, n);
        if (chmax(ret, cost)) {
            trace[i][rem] = j;
        }
    }

    return ret;
}

signed main() {
    cin >> n >> k;
    For (i, 1, n) {
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }

    memset(dp, -1, sizeof(dp));
    cout << go(1, k) << '\n';

    int p = 1;

    Ford (i, k, 1) {
        cout << trace[p][i] << " \n"[i == 1];
        p = trace[p][i] + 1;
    }

    return 0;
}

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