# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7663 | imsifile | Split the sequence (APIO14_sequence) | C++98 | 604 ms | 84764 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>
#define sq(a) ((a)*(a))
#define sik(l,x) (-(l.a)*(x)+(l.b))
typedef long long lld;
struct lin {
int ix;
lld a, b; // -ax+b
}stk[100100], im;
int n, k, di[100100][202], scn;
lld ba[100100], dy[100100][2];
int main(){
int i, i2, j, t=1;
scanf("%d%d", &n, &k);
for(i=1; i<=n; i++){
scanf("%lld", &ba[i]), ba[i]+=ba[i-1];
dy[i][0]=sq(ba[i]);
}
for(j=1; j<=k; j++){
im.a=2*ba[j], im.b=dy[j][1-t]+sq(ba[j]), im.ix=j;
stk[0]=im, scn=1;
for(i=1; i<=j; i++)dy[i][t]=0;
for(i=j+1, i2=0; i<=n; i++){
for(; i2<scn-1; i2++){
if(sik(stk[i2],ba[i])<sik(stk[i2+1],ba[i]))break;
}
di[i][j]=stk[i2].ix, dy[i][t]=sq(ba[i])+sik(stk[i2],ba[i]);
# | 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... |