这篇博客详细介绍了如何解决POJ 1160题目的邮局选址问题，通过动态规划（DP）策略来避免暴力求解导致的时间超限。博主发现，当在a到b个村庄之间建立一个邮局时，最佳位置往往位于中间村庄。通过数学推导得出公式：sum[i][j]=sum[i][j-1]+value[j]-value[(i+j)/2]，并利用该公式进行状态转移。最后，博主分享了如何初始化DP数组的起始值，即dp[1][i]=sum[1][i]。
Post Office
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 17168 | Accepted: 9270 |
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
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
最低0.47元/天 解锁文章
扫一扫
526
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
