IOI '00 P5 - Post Office (2)

#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> x(1+n);
    for (int i = 1; i <= n; ++i) cin >> x[i], x[i] += x[i-1];

    auto A = [&x](int l, int r) {
        return (x[r]-x[r-(r-l+1)/2]) - (x[l+(r-l+1)/2-1]-x[l-1]);
    };

    vector<vector<int>> dp(1+n, vector<int>(1+n, INF));
    vector<vector<int>> pos(1+n, vector<int>(2+n));
    for (int i = 1; i <= n; ++i) {
        dp[i][1] = A(1, i);
        pos[i][i+1] = i-1;
    }
    for (int i = 2; i <= n; ++i) {
        for (int j = i; j >= 2; --j) {
            for (int k = pos[i-1][j]; k <= pos[i][j+1]; ++k) {
                dp[i][j] = min(dp[i][j], dp[k][j-1] + A(k+1, i));
            }
            for (int k = pos[i-1][j]; k <= pos[i][j+1]; ++k) {
                if (dp[i][j] == dp[k][j-1] + A(k+1, i)) pos[i][j] = k;
            }
        }
    }
    cout << dp[n][m] << endl;
    vector<int> v;
    for (int i = n, j = m; j >= 1; i = pos[i][j--]) {
        int k = (i + pos[i][j]+1)/2;
        v.push_back(x[k]-x[k-1]);
    }
    for (int i = m-1; i >= 0; --i) cout << v[i] << ' ';
    cout << endl;
    return 0;
}