POJ 1160 DP 解题报告
来源:互联网 发布:ubuntu 16.04安装lnmp 编辑:程序博客网 时间:2024/06/05 10:18
Post Office
Description
There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordinate. There are no two villages in the same position. The distance between two positions is the absolute value of the difference of their integer coordinates.
Post offices will be built in some, but not necessarily all of the villages. A village and the post office in it have the same position. For building the post offices, their positions should be chosen so that the total sum of all distances between each village and its nearest post office is minimum.
You are to write a program which, given the positions of the villages and the number of post offices, computes the least possible sum of all distances between each village and its nearest post office.
Input
Your program is to read from standard input. The first line contains two integers: the first is the number of villages V, 1 <= V <= 300, and the second is the number of post offices P, 1 <= P <= 30, P <= V. The second line contains V integers in increasing order. These V integers are the positions of the villages. For each position X it holds that 1 <= X <= 10000.
Output
The first line contains one integer S, which is the sum of all distances between each village and its nearest post office.
Sample Input
10 5
1 2 3 6 7 9 11 22 44 50
Sample Output
9
【解题报告】
本来想用四边形优化的,结果发现并不需要。
代码如下:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define N 305 #define inf 0x3fffffff;int dp[N][35]; //在前i个村庄中建立j个邮局的最小耗费 int dis[N][N];//dis[i][j]:第i个村庄到第j个村庄建一个邮局的最短距离 int x[N]; //村庄位置 int main() { int v,p,i,j,k; while(scanf("%d%d",&v,&p)!=-1) { for(i=1;i<=v;i++) scanf("%d",&x[i]); for(i=1;i<=v;i++) { for(j=i+1;j<=v;j++) { dis[i][j]=dis[i][j-1]+x[j]-x[(i+j)/2]; } } for(i=1;i<=v;i++) { dp[i][i]=0; //一个村庄一个邮局距离为零 dp[i][1]=dis[1][i]; //前i个村庄建立一个邮局 } for(j=2;j<=p;j++) { for(i=j+1;i<=v;i++) { dp[i][j]=inf; for(k=j-1;k<i;k++) { dp[i][j]=min(dp[i][j],dp[k][j-1]+dis[k+1][i]); } } } printf("%d\n",dp[v][p]); } return 0; }
让我看到你们的双手
- POJ 1160 DP 解题报告
- Poj 1260 DP 解题报告
- POJ 1260 DP解题报告
- 状态压缩DP POJ 1699解题报告
- [dp]POJ 3176 Cow Bowling解题报告
- [dp]POJ 2229 Sumsets 解题报告
- POJ 3252 数位DP 解题报告
- POJ 2096 概率DP 解题报告
- poj 2096 概率DP 解题报告
- poj 2096 期望DP 解题报告
- poj 1417 True Liars 解题报告 并查集 DP
- poj 2441Arrange the Bulls解题报告-状态压缩dp
- poj 2288 Islands and Bridges解题报告-状态压缩dp
- POJ 1739 Tony's Tour 解题报告(插头DP)
- POJ 3133 Manhattan Wiring 解题报告(插头DP)
- POJ 3356 AGTC 解题报告(Edit Distance,DP)
- POJ 1463 Strategic game (树形DP) 解题报告
- POJ 1260 Pearls ACM解题报告(区间dp)
- 给定一个double类型的浮点数base和int类型的整数exponent。求base的exponent次方。
- Hadoop YARN官方介绍
- Android 开发资料便签
- 【图片选择】Android 仿微信图片选择器疾风加载 (单选,多选,相机)--唯剑做伴且随疾风前行
- Java进阶--深入理解ArrayList实现原理
- POJ 1160 DP 解题报告
- 字符识别组件Aspose.OCR V17.03发布 | 附下载
- 视频应用的客户端安全性不高,易遭受“黑客”攻击! [APP安全报告第22期]
- 函数声明后面的const用法
- react.js初学之环境搭建
- Cordova进阶:插件开发
- Oracle 12.2新特性掌上手册
- OkHttp源码解析(二)
- loadrunner 场景设计-添加Windows Resources计数器