分析:这是一个双调路径问题。
题目是要从左往右敲,没有规定是先从哪个石头开始,敲到最右时反过来敲,并且每一个石头都要敲一次,
如果从最左边引入一个虚点,那么问题就变成了两个人A、B同时从虚点出发往右走,并且中间走过的点不能重复,假设走在最前的是A。
那么:f(i,j)为A走到i点,B走到j点的 the minimum sum of tone difference(不知道怎么翻译好,水平有限)。
f(i,j) = f(i,i) = f(i,i-1) + | dist[i] - dist[i-1] | if i=j
= min{ f(j,k) + | dist[i] - dist[k] |,0<=k<=j } if i=j+1
= f(i-1,j) + | dist[i] - dist[i-1] | if i>j+1
再来优化一下,f(i,j)是二元函数,来应该用2维数组DP的,但这里和背包问题有些共通点,所以可以变为1维。
Code
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
/**/
#include "stdio.h"
#define min(a,b) (a<b?a:b)
#define abs(x) (x<0?-(x):x)
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
int dist[101],dp[101],n,i,j,k;
int main()
![ExpandedBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![ContractedBlock.gif](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
while(1)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
scanf("%d",&n);
if(n==0)
break;
for(i=1;i<=n;++i)
scanf("%d",&dist[i]);
dp[0] = 0;
for(i=2;i<=n;++i)
![ExpandedSubBlockStart.gif](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
int m = 1000000;
for(k=i-1;k>=0;--k)
m = min(m,dp[k]+(k==0?0:abs(dist[i]-dist[k])));
dp[i-1] = m;
dp[i] = dp[i-1] + abs(dist[i]-dist[i-1]);
for(j=0;j<i-1;++j)
dp[j] = dp[j] + abs(dist[i]-dist[i-1]);
}
printf("%d\n",dp[n]);
}
return 0;
}