Submission #852128

#	Time	Username	Problem	Language	Result	Execution time	Memory
852128		chanhchuong123	Split the sequence (APIO14_sequence)	C++14	60 / 100	65 ms	131072 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define task ""

const long long INF = LLONG_MAX;
const int MAX = 100001;
int n, k;
int a[MAX];
int pf[MAX];
int trace[MAX][202];
long long dp[MAX][202];

struct Line {
    long long m, c; int id;

    Line(long long _m = 0, long long _c = 0, int _id = 0) {
        m = _m;
        c = _c;
        id = _id;
    }

    long long eval(long long x) {
        return m * x + c;
    }

    double intersect(const Line &other) const {
        return 1.0 * (c - other.c) / (other.m - m);
    }
};

struct ConvexHullTrick {
    vector<Line> lines;
    int pt = 0;

    bool bad(const Line &l1, const Line &l2, const Line &l3) {
        return 1LL * (l1.c - l3.c) * (l2.m - l1.m) <= 1LL * (l1.c - l2.c) * (l3.m - l1.m);
    }

    void add(long long m, long long c, int id) {
        Line line(m, c, id); while (lines.size() >= 2 && bad(lines[lines.size() - 2], lines.back(), line)) lines.pop_back();
        lines.push_back(line); pt = min(pt, int(lines.size()) - 1);
    }

    pair<long long, int> get(long long x) {
        if (lines.size() == 1) return make_pair(lines[0].eval(x), lines[0].id); while (pt + 1 < lines.size() && lines[pt + 1].eval(x) >= lines[pt].eval(x)) ++pt;
        return make_pair(lines[pt].eval(x), lines[pt].id);
    }
} cht[202];

int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);

	if (fopen(task".inp", "r")) {
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}

	cin >> n >> k; ++k;
	for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        pf[i] = pf[i - 1] + a[i];
	}
	cht[0].add(0, 0, 0);
    for (int i = 1; i <= n; ++i) {
        for (int j = min(i, k); j >= 1; --j) {
            pair<long long, int> cur = cht[j - 1].get(pf[i]);
            trace[i][j] = cur.second;
            dp[i][j] = cur.first;
            cht[j].add(pf[i], - 1LL * pf[i] * pf[i] + dp[i][j], i);
        }
    }
    cout << dp[n][k] << '\n';
    vector<int> posAns;
    do {
        n = trace[n][k--];
        posAns.push_back(n);
    } while (k > 1);
    for (int &id: posAns) {
        cout << id << ' ';
    }
	return 0;
}

/*
7 3
4 1 3 4 0 2 3
*/

Compilation message (stderr)

sequence.cpp: In member function 'std::pair<long long int, int> ConvexHullTrick::get(long long int)':
sequence.cpp:45:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   45 |         if (lines.size() == 1) return make_pair(lines[0].eval(x), lines[0].id); while (pt + 1 < lines.size() && lines[pt + 1].eval(x) >= lines[pt].eval(x)) ++pt;
      |         ^~
sequence.cpp:45:81: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   45 |         if (lines.size() == 1) return make_pair(lines[0].eval(x), lines[0].id); while (pt + 1 < lines.size() && lines[pt + 1].eval(x) >= lines[pt].eval(x)) ++pt;
      |                                                                                 ^~~~~
sequence.cpp:45:95: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         if (lines.size() == 1) return make_pair(lines[0].eval(x), lines[0].id); while (pt + 1 < lines.size() && lines[pt + 1].eval(x) >= lines[pt].eval(x)) ++pt;
      |                                                                                        ~~~~~~~^~~~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:54:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:55:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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