HDU 1500 DP

反着存储数据，DP时就不需要考虑第三根筷子了。

然后很简单的DP，用滚动数组处理

#include "stdio.h"
#include "string.h"
#include "stdlib.h"
#include "math.h"

struct comp
{
	int x[5010];
} dp1,dp2;
int num[5010];

int minn(int x,int y)
{
	if (x<y) return x;
	else return y;
}
int main()
{
	int t,k,n,j,i,min;
	scanf("%d",&t);
	while (t--)
	{
		scanf("%d%d",&k,&n);

		for (i=n;i>=1;i--)
			scanf("%d",&num[i]);

		memset(dp1.x,0,sizeof(dp1.x));
		memset(dp2.x,0,sizeof(dp2.x));

		k+=8;

		for (i=1;i<=k;i++)
		{
			dp2.x[i*3]=dp1.x[i*3-2]+ (num[i*3]-num[i*3-1])*(num[i*3]-num[i*3-1]);

			for (j=i*3+1;j<=n;j++)
				dp2.x[j]=minn(dp2.x[j-1],dp1.x[j-2]+(num[j]-num[j-1])*(num[j]-num[j-1]));

			dp1=dp2;

			memset(dp2.x,0,sizeof(dp2.x));
		}

		min=0x7fffffff;
		for (i=3*k;i<=n;i++)
			if (dp1.x[i]<min) min=dp1.x[i];


		printf("%d\n",min);
	}
	return 0;
}