# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
33569 | sinhriv | Split the sequence (APIO14_sequence) | C++14 | 529 ms | 131072 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 = 100010;
const int K = 22;
int n, k;
int arr[N];
int pre[N][K];
long long f[N][K];
template < class T >
struct LineIT{
/// Lim
static const T inf = -2e9;
static const T Worst = -1e18;
struct Line{
T a;
T b;
int idx;
T get(T x){
if(a < inf) return Worst;
return a * x + b;
}
};
static const int N = 1e5 + 10;
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... |