shunfurh 于 2017.01.08 11:49 提问

Print Article

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

1个回答

caozhy      2017.01.08 11:48

HDU 3507 Print Article(斜率优化DP)

HDU 3507 Print Article
#include #include #define maxn 500005 #define inf 0xffffff int dp[maxn]; int Q[maxn]; int sum[maxn]; int get1(int i) { return dp[i]+sum[i]*sum[i]; } int get2(int i,int j) { return sum[i]
hdu3507 Print Article
Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 7513    Accepted Submission(s): 2341 Problem Description Zero has an old printer th
HDU3507 Print Article
HDU3507 Print Article.关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.
[HDU 3507] Print Article