답안 #130136

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
130136	2019-07-14T05:10:38 Z	mlyean00	수열 (APIO14_sequence)	C++14	0 / 100	377 ms	5956 KB

sequence

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct line {
    int idx;
    ll a, b;

    line(int idx, ll a, ll b) : idx(idx), a(a), b(b) {}

    ll cost(ll x) const {
        return a * (x - a) + b;
    }

    ll intersect(line const& other) {
        ll lo = other.a;
        ll hi = 1LL << 58;

        while (lo < hi) {
            ll mid = (lo + hi) / 2;
            if (cost(mid) > other.cost(mid)) {
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }

        return lo;
    }
};

int main() {
    int n, k;
    cin >> n >> k;

    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<ll> pref(n, 0);
    partial_sum(a.begin(), a.end(), pref.begin());

    ll dp[k + 1][n];
    int parent[k + 1][n];

    for (int j = 0; j < n; ++j) {
        dp[0][j] = 0;
    }
    for (int i = 1; i <= k; ++i) {
        for (int j = 0; j < n; ++j) {
            dp[i][j] = LLONG_MIN;
        }
    }

    for (int i = 1; i <= k; ++i) {
        deque<line> dq;
        for (int j = 0; j < n; ++j) {
            while (dq.size() > 1 &&
                   dq[0].cost(pref[j]) <= dq[1].cost(pref[j])) {
                dq.pop_front();
            }
            if (!dq.empty()) {
                dp[i][j] = dq[0].cost(pref[j]);
                parent[i][j] = dq[0].idx;
            }
            line l(j, pref[j], dp[i - 1][j]);

            while (dq.size() > 1) {
                int sz = dq.size();
                ll t1 = dq[sz - 2].intersect(dq[sz - 1]);
                ll t2 = dq[sz - 1].intersect(l);

                if (t1 < t2) break;

                dq.pop_back();
            }
            dq.push_back(l);
        }
    }

    cout << dp[k][n - 1] << endl;

    int u = n - 1;
    for (int i = k; i > 0; --i) {
        u = parent[i][u];
        cout << (u + 1) << ' ';
    }
    cout << endl;

    return 0;
}

Subtask #1
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	contestant found the optimal answer: 108 == 108
2	Correct	2 ms	380 KB	contestant found the optimal answer: 999 == 999
3	Correct	2 ms	376 KB	contestant found the optimal answer: 0 == 0
4	Correct	2 ms	376 KB	contestant found the optimal answer: 1542524 == 1542524
5	Correct	2 ms	380 KB	contestant found the optimal answer: 4500000000 == 4500000000
6	Correct	2 ms	376 KB	contestant found the optimal answer: 1 == 1
7	Correct	2 ms	376 KB	contestant found the optimal answer: 1 == 1
8	Correct	2 ms	376 KB	contestant found the optimal answer: 1 == 1
9	Correct	2 ms	376 KB	contestant found the optimal answer: 100400096 == 100400096
10	Correct	2 ms	256 KB	contestant found the optimal answer: 900320000 == 900320000
11	Incorrect	2 ms	256 KB	contestant didn't find the optimal answer: 3598160232 < 3698080248
12	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	2 ms	256 KB	contestant didn't find the optimal answer: 1093888 < 1093956
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	3 ms	376 KB	contestant found the optimal answer: 311760000 == 311760000
3	Correct	16 ms	760 KB	contestant found the optimal answer: 1989216017013 == 1989216017013
4	Incorrect	3 ms	376 KB	contestant didn't find the optimal answer: 1272415765957 < 1499437552673
5	Halted	0 ms	0 KB	-