HDU-3507-Print Article-斜率优化-DP
来源:互联网 发布:windows 日志备份 编辑:程序博客网 时间:2024/05/21 07:04
题目:
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.
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 559575
Sample Output
230
思路:简单的斜率优化
#include<stdio.h>#include<iostream>#include<string.h>#include<queue>using namespace std;#define maxn 500050int dp[maxn];int gg[maxn];int sum[maxn];int n,m;int getDP(int i,int j) { //求出连续区间的一段值.即最基本的DP方法。 return dp[j]+m+(sum[i]-sum[j])*(sum[i]-sum[j]);}int getUP(int j,int k) { //斜率上部分 return dp[j]+sum[j]*sum[j]-(dp[k]+sum[k]*sum[k]);}int getDOWN(int j,int k) { //斜率下部分 return 2*(sum[j]-sum[k]);}int main(){ while(scanf("%d%d",&n,&m)!=EOF) { memset(sum,0,sizeof sum); memset(dp,0,sizeof dp); for(int i=1;i<=n;i++) scanf("%d",&sum[i]); for(int i=1;i<=n;i++) sum[i]+=sum[i-1]; int head=0,wei=1; gg[1]=0; for(int i=1;i<=n;i++) { while(head+1<wei&&getUP(gg[head+1],gg[head])<=sum[i]*getDOWN(gg[head+1],gg[head])) head++; //排除第一种情况 dp[i]=getDP(i,gg[head]); while(head+1<wei&&getUP(i,gg[wei-1])*getDOWN(gg[wei-1],gg[wei-2])<=getUP(gg[wei-1],gg[wei-2])*getDOWN(i,gg[wei-1])) wei--; //排除第二种情况 gg[wei++]=i; } printf("%d\n",dp[n]); } return 0;}
0 0
- hdu 3507 Print Article 斜率优化dp
- HDU 3507 Print Article【斜率优化dp】
- hdu 3507 Print Article(DP+斜率优化)
- hdu 3507 Print Article 斜率优化DP
- HDU 3507 Print Article 斜率优化DP
- HDU-3507 Print Article DP斜率优化
- HDU 3507 Print Article(斜率优化DP)
- HDU 斜率优化dp 3507 Print Article
- HDU 3507 Print Article(斜率优化dp)
- HDU 3507 Print Article 斜率优化DP
- hdu 3507 Print Article(dp斜率优化)
- HDU 3507 Print Article 斜率优化DP
- hdu 3507 Print Article(斜率优化dp)
- HDU 3507 Print Article (斜率优化DP)
- hdu 3507 Print Article 斜率优化dp
- HDU-3507-Print Article-斜率优化-DP
- hdu 3507 Print Article 斜率优化dp
- HDU-3507 Print Article 斜率优化DP
- HDU 5695 Gym Class
- 学校扼杀创造力---Ken Robinson(于2006发布于TED)
- spl_autoload_register()函数
- 物理术语的理解
- 字符串转换成整数,atoi实现
- HDU-3507-Print Article-斜率优化-DP
- 利用 Android 手机打造来电通知计划
- 使用CLion单步调试Caffe
- Mac系统下, Hdoop 2.6.2 + Hive 2.0.1 配置
- Docker安装完启动时提示Failed to start docker.service: Unit docker.service is masked.
- 旋转动画(360度一直转)
- 单点登录 不过如此
- Docker学习笔记-数据卷、数据卷容器
- 树中两个结点的最低公共祖先(超全解&&拓展)