# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
388092 | aarr | Split the sequence (APIO14_sequence) | C++14 | 156 ms | 131076 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;
const int N = 300 * 1000 + 5, K = 205;
const long long inf = 1e18 + N;
int n, k;
int a[N];
long long dp[N][K];
long long ps[N];
int par[N][K];
vector <int> vec;
long long get(int lv, int x, int y) {
return 1ll * (ps[x] - ps[y]) * (ps[x] - ps[y]) + dp[y][lv - 1];
}
void solve(int lv, int l, int r, int s, int e) {
if (r <= l) {
return;
}
int md = (l + r) / 2;
for (int i = s; i <= e; i++) {
if (get(lv, md, i) < dp[md][lv]) {
par[md][lv] = i;
dp[md][lv] = get(lv, md, i);
}
}
solve(lv, l, md, s, par[md][lv]);
solve(lv, md + 1, r, par[md][lv], e);
# | 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... |