【动态规划】print article
来源:互联网 发布:网络迷情大概剧情 编辑:程序博客网 时间:2024/05/21 14:08
Problem DescriptionZero has an old printer that doesn't work well sometimes. As it is antique, he still like touse it to print articles. But it is too old to work for a long time and it will certainly wearand 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 beprinted. 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. InputThere 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. OutputA single number, meaning the mininum cost to print the article. Sample Input5 559575 Sample Output230此题考察斜率优化的动态规划。
朴素方程:f[i] = min(f[j] + sqr(s[i] - s[j]) + m),
可得到斜率不等式:
f[j] - f[k] + sqr(s[j]) - sqr(s[k])
——————————————————— >= 2s[i]
s[j] - s[k]
注意s[j]可能等于s[k],所以斜率为0的情况需要特殊判断。
Accode:
#include <cstdio>#include <cstring>#include <cstdlib>#include <bitset>#include <algorithm>const char fi[] = "print_article.in";const char fo[] = "print_article.out";const int maxN = 500010;typedef long long int64;int64 F[maxN], s[maxN];int q[maxN];int n, m, f, r;void init_file(){ freopen(fi, "r", stdin); freopen(fo, "w", stdout); return;}inline int getint(){ int res = 0; char tmp; while (!isdigit(tmp = getchar())); do res = (res << 3) + (res << 1) + tmp - '0'; while (isdigit(tmp = getchar())); return res;}void readdata(){ s[0] = 0; for (int i = 1; i < n + 1; ++i) (s[i] = getint()) += s[i - 1]; return;}#define sqr(x) ((x) * (x))#define check(j, k, i) \(F[j] - F[k] + sqr(s[j]) - sqr(s[k]) \<= s[i] * (s[j] - s[k]) << 1)#define cmp(j, k, i) \(s[j] == s[k] ? (F[j] < F[k]) : \(s[k] == s[i] ? (F[k] > F[i]) : \(F[j] - F[k] + sqr(s[j]) - sqr(s[k])) \* (s[k] - s[i]) \<= (F[k] - F[i] + sqr(s[k]) - sqr(s[i])) \* (s[j] - s[k])))int64 work(){ f = 0, r = 1; for (int i = 1; i < n + 1; ++i) { while (f < r - 1 && !check(q[f], q[f + 1], i)) ++f; F[i] = F[q[f]] + sqr(s[i] - s[q[f]]) + m; while (f < r - 1 && !cmp(q[r - 2], q[r - 1], i)) --r; q[r++] = i; } return F[n];}int main(){ init_file(); while (scanf("%d%d", &n, &m) == 2) { readdata(); printf("%I64d\n", work()); } return 0;}#undef sqr#undef check#undef cmp
- 【动态规划】print article
- HDU_P3507 Print Article(动态规划+斜率优化)
- 【动态规划15】hdu3057 Print Article(斜率优化入门)
- hdu-3507-Print Article
- hdu 3075 Print Article
- hdu 3507 Print Article
- hdu 3507 Print Article
- HDU Print Article
- HDU 3507 Print Article
- 【HDU 3507】 Print Article
- hdu 3507Print Article
- HDOJ 3507 Print Article
- hdu-3507 Print Article
- HDU 3507 Print Article
- HDU 3507 Print Article
- hdu3507 Print Article
- hdoj 3507 Print Article
- HDU 3507 Print Article
- 委托的作用是什么
- v$session
- JAVA枚举的应用
- 'Provide value on 'System.Windows.StaticResourceExtension' threw an exception.'
- 利用irisskin2.dll美化vb.net界面
- 【动态规划】print article
- 如何使用JSON Framework库解析与生成json数据
- 关于在mac系统上开发web的配置-PHP
- 黑马程序员—java入门的知识
- hdu 2057 A+B Again
- 在程序中执行系统命令的办法
- SpringMVC 3.1 体验
- 销售与开发
- 论Android编程和windows phone编程的区别