# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243726 | HuyQuang_re_Zero | Split the sequence (APIO14_sequence) | C++14 | 55 ms | 33272 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 db long long
#define N 10002
using namespace std;
struct pt { db A,B; int vt; };
double giao(pt x,pt y)
{
return (y.B-x.B)*1.0/(x.A-y.A);
}
pt st[N];
long long g[N],f[N][202];
int i,j,n,sl,top,k,tr[N][202],d[N];
int main()
{
// freopen("ntu.inp","r",stdin);
// freopen("ntu.out","w",stdout);
cin>>n>>k; k++;
memset(f,-1,sizeof(f));
f[0][0]=0;
for(i=1;i<=n;i++) { cin>>g[i]; g[i]+=g[i-1]; }
for(sl=1;sl<=k;sl++)
{
top=0; j=1;
for(i=0;i<=n;i++)
{
if(top>0)
{
j=min(j,top);
while(j<top && st[j].A*g[i]+st[j].B<=st[j+1].A*g[i]+st[j+1].B) j++;
f[i][sl]=st[j].A*g[i]+st[j].B;
# | 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... |