[HDU3507]Print Article

题面描述

传送门

思路

状态转移方程:($s$为前缀和)

$$F_i=\min (F_j+(s_i-s_j{)}^2+m)$$

决策单调性

$$F_j+(s_i-s_j{)}^2+m\ge F_k+(s_i-s_j{)}^2+m$$

化简

$$F_j-2\ast s_i\ast s_j+{s_j}^2\ge F_k-2\ast s_i\ast s_k+{s_k}^2$$

对于未来状态$t$，证明:

$$F_j+(s_t-s_j{)}^2+m\ge F_k+(s_t-s_j{)}^2+m$$

$$F_j-2\ast s_t\ast s_j+{s_j}^2\ge F_k-2\ast s_t\ast s_k+{s_k}^2$$

由$s_t=s_i+val,$

$$F_j-2\ast (s_i+val)\ast s_j+{s_j}^2\ge F_k-2\ast (s_i+val)\ast s_k+{s_k}^2$$

由

$$F_j-2\ast s_i\ast s_j+{s_j}^2\ge F_k-2\ast s_i\ast s_k+{s_k}^2$$

可知仅需证明:

$$-2\ast val\ast s_j\ge -2\ast val\ast s_k$$

$$s_j\le s_k$$

得证。

踢队头

$$F_j-2\ast s_i\ast s_j+{s_j}^2\ge F_k-2\ast s_i\ast s_k+{s_k}^2$$

$$F_j-F_k+{s_j}^2-{s_k}^2\ge 2\ast s_i\ast (s_j-s_k)$$

由$s_j-s_k<0$

$$calc(j,k)=\frac{F_j-F_k+{s_j}^2-{s_k}^2}{s_j-s_k}\le 2\ast s_i$$

当$calc(j,k)\le 2\ast s_i$时，$k$优于$j$.

因此当$$calc(q_{head},q_{head+1})\le 2\ast s_i$$

$head+1$优于$head$。

由于$s_i$随$i$增大而增大，那么$calc(q_{head},q_{head+1})$随$head$增大而增大，才符合$head$为最优解，因此斜率是不断递增的。

踢队尾

根据斜率是不断递增的，仅当

$$calc(q_{tail},i)\ge calc(q_{tail-1},q_{tail})$$

斜率才满足不断递增。

故当

$$calc(q_{tail},i)\le calc(q_{tail-1},q_{tail})$$

删去队尾。

特别提醒

当$c_i=0$时，$s_{i-1}=s_i$；

不具有单调性，所以要进行特殊操作。

AC code

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#define gc getchar()
#define ll long long
using namespace std;
const int N=5e5+10;
inline void qr(ll &x)
{
	x=0;int f=1;char c=gc;
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=gc;}
	while(c>='0'&&c<='9'){x=x*10+(c^48);c=gc;}
	x*=f;
}
inline void qw(ll x)
{
	if(x<0)x=-x,putchar('-');
	if(x/10)qw(x/10);
	putchar(x%10+48);
}
ll f[N],s[N];int q[N],l,r;
inline double calc(int j,int k)
{
	if(s[j]-s[k]==0)return -1e10;
	return (f[j]-f[k]+s[j]*s[j]-s[k]*s[k])/(double)(s[j]-s[k]);
}
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		memset(s,0,sizeof(s));memset(f,0,sizeof(f));
		for(int i=1;i<=n;i++){qr(s[i]);s[i]+=s[i-1];}
		l=1;r=1;q[1]=0;
		for(int i=1;i<=n;i++)
		{
			while(l<r&&calc(q[l],q[l+1])<2.0*s[i])++l;
			f[i]=f[q[l]]+(s[i]-s[q[l]])*(s[i]-s[q[l]])+m;
			while(l<r&&calc(q[r],i)<calc(q[r-1],q[r]))--r;
			q[++r]=i;
		}
		qw(f[n]);puts("");
	}
	return 0;
}