# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8145 | gs13031 | Split the sequence (APIO14_sequence) | C++98 | 1904 ms | 85860 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<stdio.h>
int n, k, a[100010], sl[100010][210], j;
long long d[100010], dd[100010], s[100010];
void get_l(int st, int ed, int left, int right)
{
int i, q, p;
long long m=9e18, x;
if(left>right) return;
p=(left+right)/2;
if(st==ed)
{
for(i=left; i<=right; ++i) sl[i][j]=st;
return;
}
for(i=st; i<=ed; ++i)
{
x=d[i]+(s[p]-s[i])*(s[p]-s[i]);
if(m>x){ m=x; q=i; }
}
sl[p][j]=q;
get_l(st, q, left, p-1);
get_l(q, ed, p+1, right);
return;
}
void back(int x, int dep)
{
if(dep>1)
{
back(sl[x][dep], dep-1);
printf("%d ", sl[x][dep]);
# | 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... |