poj 1160 Post Office(DP-简单DP)
来源:互联网 发布:淘宝banner设计 编辑:程序博客网 时间:2024/04/30 06:58
Post Office
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15380 Accepted: 8334
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.
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 51 2 3 6 7 9 11 22 44 50
Sample Output
9
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 10010;const int INF = 1000000000;int A[310] , sum[maxn] , sumA[maxn], dp[310][40][2];int V , P;void initial(){ memset(A , 0 , sizeof A); memset(sum , 0 , sizeof sum); memset(sumA , 0 , sizeof sumA); for(int i = 0; i < 310; i++){ for(int j = 0; j < 40; j++){ dp[i][j][0] = INF; dp[i][j][1] = INF; } }}void readcase(){ for(int i = 0; i < V; i++){ scanf("%d" , &A[i]); sum[A[i]] = A[i]; sumA[A[i]] = 1; } for(int i = 1; i <= A[V-1]; i++){ sum[i] = sum[i]+sum[i-1]; sumA[i] = sumA[i]+sumA[i-1]; }}void computing(){ for(int i = 0; i < V; i++){ dp[i][1][1] = (i+1)*A[i]-sum[A[i]]; } for(int i = 1; i < V; i++){ for(int k = 1; k <= min(i+1 ,P); k++){ for(int j = 0; j < i; j++){ if(k > 1){ dp[i][k][1] = min(dp[i][k][1] , dp[j][k-1][1]+2*sum[(A[i]+A[j])/2]-sum[A[i]]-sum[A[j]]-(sumA[(A[i]+A[j])/2]-sumA[A[j]])*A[j]+(sumA[A[i]]-sumA[(A[i]+A[j])/2])*A[i]); } dp[i][k][0] = min(dp[i][k][0] , dp[j][k][1]+sum[A[i]]-sum[A[j]]-(sumA[A[i]]-sumA[A[j]])*A[j]); } } } cout << min(dp[V-1][P][0] , dp[V-1][P][1]) << endl;}int main(){ while(scanf("%d%d" , &V , &P) != EOF){ initial(); readcase(); computing(); } return 0;}
0 0
- poj 1160 Post Office(DP-简单DP)
- poj 1160 Post Office(DP简单题)
- POJ 1160 Post Office(DP)
- poj - 1160 - Post Office(dp)
- poj 1160 Post Office(DP)
- poj 1160 Post Office(dp)
- POJ 1160 Post Office(经典DP)
- POJ 1160 Post Office(dp)
- POJ 1160 Post Office(dp)
- POJ 1160 Post Office(经典DP)
- poj-1160 post office (dp)
- Post Office - POJ 1160 dp
- 【DP】 POJ 1160 Post Office
- POJ 1160 Post Office DP
- POJ 1160 Post Office (DP)
- poj 1160 post office------DP
- POJ 1160 Post Office (经典dp)
- Poj-1160 Post Office(经典dp
- fragmentActivity跳转不成功
- An internal error occurred during: "Building workspace".
- POJ-2287-Tian Ji -- The Horse Racing
- iptables基础知识.详解
- 转:undefined reference to 'pthread_create'问题解决
- poj 1160 Post Office(DP-简单DP)
- Hibernate事务与并发问题处理(乐观锁与悲观锁)
- 轴承剥离型故障对应的特征频率
- jquery判断checkbox是否选中及改变checkbox状态
- 从英文中获取求职方略
- pc端和移动端的css样式写法
- PMC举办OTN研讨会:回顾OTN研发历程,解析OTN在中国的发展
- 三阶魔方还原 two phase 算法 学习笔记
- 内存数据库:大数据时代数据管理新宠