zju 1234 Chopsticks (DP)

#include<iostream>
#include<cstring>
using namespace std;

#define MAX_N 5001
#define Min(a,b) (a)<(b)?(a):(b)
int dp[2][MAX_N],Dischop[MAX_N],T,K,N;

int main(){
//	freopen("in.txt","r",stdin);
//	freopen("out.txt","w",stdout);
cin>>T;
while(T--){
cin>>K>>N;
K+=8;
int i=1,j;
while(i<=N)
cin>>Dischop[i++];
memset(dp,0,sizeof(dp));
for(i=1;i<=K;i++){
j=i<<1;
dp[1][j]=dp[0][j-2]+(Dischop[j]-Dischop[j-1])*(Dischop[j]-Dischop[j-1]);
j++;
while(j<N-3*(K-i)){

dp[1][j]=dp[0][j-2]+(Dischop[j]-Dischop[j-1])*(Dischop[j]-Dischop[j-1]);
dp[1][j]=Min(dp[1][j],dp[1][j-1]);
j++;
}
dp[1][j]=dp[1][j-1];
memcpy(dp[0],dp[1],sizeof(dp[0]));
}
cout<<dp[1]
<<endl;
}
return 0;
}

#include<stdio.h>

#define MAX_N 5001
long chop[MAX_N],dp[MAX_N][MAX_N/5];

int main(){
int T,N,K,i,j;
scanf("%d",&T);
while(T--){
scanf("%d %d",&K,&N);
K+=8;
int t=0,s;
for(i=1;i<=N;i++){
scanf("%d",&s);
chop[i-1]=(s-t)*(s-t);
t=s;
}
for(i=0;i<=N;i++)
for(j=0;j<=K;j++)
j==0?dp[i][j]=0:dp[i][j]=-1;

for(i=N-2;i>=1;i--){
for(j=1;j*3<=(N-i+1);j++){
dp[i][j]=dp[i+1][j];
if(dp[i+2][j-1] >= 0 &&
(dp[i+2][j-1]+chop[i] < dp[i][j] ||dp[i][j] == -1) )
dp[i][j]=dp[i+2][j-1]+chop[i];
}
}
printf("%ld\n",dp[1][K]);
}
return 0;
}