제출 #321472

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321472		shart23	수열 (APIO14_sequence)	C++14	100 / 100	1191 ms	85756 KiB

sequence

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
using ll = long long;

using namespace std;

struct Line {
    ll k;
    ll b;

    Line(ll k_, ll b_) : k(k_), b(b_) {}
};

struct CHT {
    const ll INF = (ll) 1e18;
    vector<Line> lns;
    vector<double> pts = {(double) -INF};
    vector<int> inds;
    int ind_ = 0;

    double inter(Line ln1, Line ln2) {
        double x = (ln2.b - ln1.b) / (double) (ln1.k - ln2.k);
        return x;
    }

    void add(ll k, ll b, int ind) {
        Line nln(k, b);
        while ((int) lns.size() > 1) {
            if (k == lns.back().k) {
                if (b < lns.back().b) {
                    return;
                }
                lns.pop_back();
                inds.pop_back();
                pts.pop_back();
                continue;
            }
            double nx = inter(nln, lns[(int) lns.size() - 2]);
            if (nx < pts.back()) {
                lns.pop_back();
                inds.pop_back();
                pts.pop_back();
            } else {
                break;
            }
        }
        if (!lns.empty() && lns.back().k == k) {
            if (b < lns.back().b) {
                return;
            }
            lns.pop_back();
            inds.pop_back();
            lns.push_back(nln);
            inds.push_back(ind);
        } else {
            lns.push_back(nln);
            inds.push_back(ind);
            if ((int) lns.size() > 1) {
                pts.push_back(inter(lns.back(), lns[(int) lns.size() - 2]));
            }
        }
    }

    pair<ll, int> best(int x) {
        while (pts[ind_] > x) {
            ind_--;
        }
        while (ind_ < (int) pts.size() - 1 && pts[ind_ + 1] <= x) {
            ind_++;
        }
        return {lns[ind_].k * x + lns[ind_].b, inds[ind_]};
    }
};

int par[201][100001];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, k;
    cin >> n >> k;
    vector<ll> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] += a[i - 1];
    }
    vector<ll> dp(n + 1);
    for (int j = 1; j <= k; j++) {
        CHT cht;
        cht.add(a[j - 1], dp[j - 1] - a[j - 1] * a[j - 1], j - 1);
        vector<ll> ndp(n + 1);
        for (int i = j; i <= n; i++) {
            auto res = cht.best(a[i]);
            ndp[i] = res.first;
            par[j][i] = res.second;
            cht.add(a[i], dp[i] - a[i] * a[i], i);
        }
        swap(dp, ndp);
    }
    ll ans = dp[n];
    cout << ans << '\n';
    vector<int> path;
    int now = n;
    for (int i = k; i >= 1; i--) {
        now = par[i][now];
        path.push_back(now);
    }
    reverse(all(path));
    for (int el : path) {
        if (el > 0) {
            cout << el << ' ';
        }
    }
    cout << '\n';
}
/*
7 3
4 1 3 4 0 2 3
 */

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