# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852160 | chanhchuong123 | Split the sequence (APIO14_sequence) | C++14 | 393 ms | 90120 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define task ""
const long long INF = 1e18 + 0702;
const int MAX = 100010;
int n, k;
int a[MAX];
int pf[MAX];
int trace[MAX][202];
long long dp[2][MAX];
struct Line {
int m; long long c; int id;
Line(int _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;
}
};
struct ConvexHullTrick {
vector<Line> lines;
int pt = 0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |