hdu 1227 Fast Food（DP）

int n,k;
int pos[205];
int dp[35][205];



int calc(int pre,int now){
    int ans=0;
    rep(i,pre,now){
        ans+=min( pos[i]-pos[pre],pos[now]-pos[i] );
    }
    return ans;
}
int calc2(int last){
    int ans=0;
    rep(i,last,n){
        ans+=(pos[i]-pos[last]);
    }
    return ans;
}

int main(){
    int T=0;
    while(scanf("%d%d",&n,&k)!=EOF,n||k){
        rep(i,1,n) scanf("%d",&pos[i]);

        sort(pos+1,pos+1+n);

        mem(dp,inf);
        dp[1][1]=0;

        rep(now,1,n-k+1){
            dp[1][now]=0;
            rep(j,1,now-1){
                dp[1][now]+=(pos[now]-pos[j]);
            }
        }
        rep(i,2,k){ //第i个depot
            rep(now,i,n-k+i){ //第i个depot放置的编号
                rep(pre,i-1,now-1){ //第i-1个depot放置的编号
                    dp[i][now]=min( dp[i][now],dp[i-1][pre]+calc(pre,now) );
                }
            }
        }

        int ans=inf;
        rep(last,k,n){
            ans=min( ans,dp[k][last]+calc2(last) );
        }
        printf("Chain %d\n",++T);
        printf("Total distance sum = %d\n\n",ans);
    }

    return 0;
}