从这里学习了斜率dp:http://www.cnblogs.com/ka200812/archive/2012/08/03/2621345.html
照葫芦画瓢写了一遍,然后感觉po主写得太好了基本没什么别的好讲
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
ll rec[505000];
ll dp[505000];
ll sum[505000];
int que[505000];
int n, m;
ll getdp(int i, int j){
return dp[j]+m+(sum[i]-sum[j])*(sum[i]-sum[j]);
}
ll getup(int j, int k){
return (dp[j]+sum[j]*sum[j])-(dp[k]+sum[k]*sum[k]);
}
ll getdown(int j, int k){
return 2*(sum[j]-sum[k]);
}
int main()
{
while(~scanf("%d%d", &n, &m)){
for(int i=1;i<=n;i++)
{
scanf("%lld", &rec[i]);
}
dp[0]=sum[0]=0;
for(int i=1;i<=n;i++)sum[i]=sum[i-1]+rec[i];
memset(dp, 0, sizeof(dp));
// memset(que, 0, sizeof(que));
int head=1, tail=0;
que[++tail]=0;
for(int i=1;i<=n;i++){
while(tail-head+1>=2&&getup(que[head+1], que[head])<=sum[i]*getdown(que[head+1], que[head]))head++;
dp[i]=getdp(i, que[head]);
while(tail-head+1>=2&&getup(i, que[tail])*getdown(que[tail], que[tail-1])<=getup(que[tail], que[tail-1])*getdown(i, que[tail])){
tail--;
}
que[++tail]=i;
}
printf("%lld\n", dp[n]);
}
}
由于题目数据不保证sum严格递增,所以<=变成<会wa,具体原因也不怎么清楚,然后记住用<=稳一点就可以了吧