# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36858 | ae04071 | Split the sequence (APIO14_sequence) | C++11 | 0 ms | 1008 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 <cstdio>
#include <algorithm>
#include <vector>
#include <assert.h>
using namespace std;
typedef long long lli;
int n,k;
lli arr[100001],psum[100001],cache[100001][201],pr[100001][201];
lli a[100001],b[100001];
int pi[100001],sz,si;
vector<int> res;
bool inter() {
lli le = (b[sz-1]-b[sz-2])*(a[sz-1]-a[sz]);
lli ri = (b[sz]-b[sz-1])*(a[sz-2]-a[sz-1]);
return le>=ri;
}
void push(int i,int j) {
if(sz!=0 && a[sz-1]==psum[i]) {
lli bb=cache[i][j] - psum[i] * psum[i];
if(bb>b[sz-1]) {
b[sz-1] = bb;
pi[sz-1] = i;
}
return;
}
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... |