HDU 3507斜率优化dp

Print Article

Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 12185    Accepted Submission(s): 3733

Problem Description

Zero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for a long time and it will certainly wear and tear, so Zero use a cost to evaluate this degree.
One day Zero want to print an article which has N words, and each word i has a cost Ci to be printed. Also, Zero know that print k words in one line will cost

M is a const number.
Now Zero want to know the minimum cost in order to arrange the article perfectly.

 

Input

There are many test cases. For each test case, There are two numbers N and M in the first line (0 ≤ n ≤ 500000, 0 ≤ M ≤ 1000). Then, there are N numbers in the next 2 to N + 1 lines. Input are terminated by EOF.

 

Output

A single number, meaning the mininum cost to print the article.

 

Sample Input

5 5

5
9
5
7
5

 

Sample Output

230

 

Author

Xnozero

 

Source

2010 ACM-ICPC Multi-University Training Contest（7）——Host by HIT

 题意：

有n个字，每个字有权值a[i],要打印第j到第i之间的字要花费sum（a[i]~a[j]）+m的费用，求最少花费。

输入n，m

输入n个数的a[i]

代码：

//和上一个题一样，dp[i]=min(dp[j]+m+(sum[i]-sum[j])^2)
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int maxn=;
int n,m,que[maxn];
ll sum[maxn],dp[maxn];
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]-dp[k]+sum[j]*sum[j]-sum[k]*sum[k];
}
ll getlow(int j,int k){
    return *(sum[j]-sum[k]);
}
int main()
{
    while(scanf("%d%d",&n,&m)==){
        sum[]=;
        for(int i=;i<=n;i++){
            scanf("%lld",&sum[i]);
            sum[i]+=sum[i-];
        }
        int head=,tail=;
        que[tail++]=;
        for(int i=;i<=n;i++){
            while(head+<tail&&getup(que[head+],que[head])<sum[i]*getlow(que[head+],que[head]))
                head++;
            dp[i]=getdp(i,que[head]);
            while(head+<tail&&getup(que[tail-],que[tail-])*getlow(i,que[tail-])>=getup(i,que[tail-])*getlow(que[tail-],que[tail-]))
                tail--;
            que[tail++]=i;
        }
        printf("%lld\n",dp[n]);
    }
    return ;
}