# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304420 | vipghn2003 | Split the sequence (APIO14_sequence) | C++14 | 1473 ms | 81848 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>
#define ll long long
using namespace std;
const int N=1e5+5;
const int K=205;
int n,k,a[N],opt[K][N];
ll s[N],dp[2][N];
void calc(int lev,int l,int r,int L,int R)
{
if(l>r) return ;
int mid=(l+r)/2;
dp[1][mid]=1e18;
for(int i=L;i<=min(mid-1,R);i++)
{
if(dp[1][mid]>dp[0][i]+(s[mid]-s[i])*(s[mid]-s[i]))
{
dp[1][mid]=dp[0][i]+(s[mid]-s[i])*(s[mid]-s[i]);
opt[lev][mid]=i;
}
}
calc(lev,l,mid-1,L,opt[lev][mid]);
calc(lev,mid+1,r,opt[lev][mid],R);
}
main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
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... |