4518: [Sdoi2016]征途 DP+斜率优化

最新推荐文章于 2020-06-01 20:59:30 发布

ws_fqk

最新推荐文章于 2020-06-01 20:59:30 发布

阅读量490

点赞数

分类专栏： My Code

本文链接：https://blog.csdn.net/Phenix_2015/article/details/51164385

版权

My Code 专栏收录该内容

349 篇文章 1 订阅

订阅专栏

f i, j = f k, j - 1 + (s u m i - s u m k) 2

$f_{i,j}=f_{k,j-1}+(sum_i-sum_k)^2$
设

w<q $w<q$ ，且

q $q$ 比

w $w$ 优。
则有

( f w , j - 1 + s u m 2 w ) - ( f q , j - 1 + s u m 2 q ) s u m w - s u m q < 2 * s u m i

$\frac{(f_{w,j-1}+sum_w^2)-(f_{q,j-1}+sum_q^2)}{sum_w-sum_q}<2*sum_i$
然后斜率优化

#include<iostream>
#include<cstdio>
#define pll pair<long long,long long>
using namespace std;

const int N=3005;
const long long INf=1e18;
long long f[N],sum[N];
int n,m;
pll q[N];

inline long long read()
{
    long long a=0,f=1; char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
    while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
    return a*f;
}

inline long long sqr(long long x)
{
    return x*x;
}

double slop(pll x,pll y)
{
    return (x.first-y.first)/(x.second-y.second);
}

int main()
{
    n=read(); m=read();
    for (int i=1;i<=n;i++)
        sum[i]=read()+sum[i-1];
    for (int i=1;i<=n;i++)
        f[i]=sqr(sum[i]);
    for (int j=2;j<=m;j++)
    {
        int t=1,w=0;
        for (int i=1;i<=n;i++)
        {
            pll now=make_pair(f[i]+sqr(sum[i]),sum[i]);
            while (t<w&&slop(now,q[w])<slop(q[w],q[w-1])) w--;
            q[++w]=now;
            while (t<w&&slop(q[t+1],q[t])<2*sum[i]) t++;
            f[i]=sum[i]*sum[i]+q[t].first-2*q[t].second*sum[i];
        }
    }
    cout << f[n]*m-sqr(sum[n]) << endl;
    return 0;
}