poj1160 Post Office

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int dp[330][40];//dp[i][j]  0,,,i   j       
int L[330][330];//L[i][j]  [i,j]        
int village[330];
void Run(int i,int j)
{
	int mid=(i+j)/2;
	L[i][j]=0;
	for(int k=i;k<=j;k++)
	{
		L[i][j]+=abs(village[mid]-village[k]);
	}
}
void RunDp(int i,int j)// dp[i][j]   [0,i]
{
	if(j==1)
	{
		if(L[0][i]==-1)
		{
			Run(0,i);
		}
		dp[i][j]=L[0][i];
		return;
	}
	if(i==0)
	{
		if(j>=1)
		{
			dp[i][j]=0;
		}
		return;
	}
	for(int k=0;k<i;k++)
	{
		if(dp[k][j-1]==-1)
		{
			if(k==0&&j==1)
			{
				k=0;
			}
			RunDp(k,j-1);
		}
		if(L[k+1][i]==-1)
		{
			Run(k+1,i);
		}
		if(dp[i][j]==-1||dp[i][j]>dp[k][j-1]+L[k+1][i])
		{
			dp[i][j]=dp[k][j-1]+L[k+1][i];
		}
	}
}
int main()
{
	int V,P;
	while(~scanf("%d%d",&V,&P))
	{
		memset(dp,-1,sizeof(dp));
		memset(L,-1,sizeof(L));
		for(int i=0;i<V;i++)
		{
			scanf("%d",&village[i]);
		}
		RunDp(V-1,P);
		printf("%d
",dp[V-1][P]);
	}
	return 0;
}