POJ 1160 DP 解题报告

最新推荐文章于 2021-03-25 23:29:42 发布

onepointo

最新推荐文章于 2021-03-25 23:29:42 发布

阅读量385

点赞数

分类专栏： ————DP———— DP——裸文章标签： poj dp

本文链接：https://blog.csdn.net/onepointo/article/details/72519273

版权

————DP———— 同时被 2 个专栏收录

69 篇文章 0 订阅

订阅专栏

DP——裸

19 篇文章 0 订阅

订阅专栏

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

【解题报告】
本来想用四边形优化的，结果发现并不需要。

代码如下：

#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;  
}