Poj Solution 1485

http://poj.org/problem?id=1485

#include <iostream>
#define MAX 200000000
using namespace std;
long r[300],sum[300][40],one[300][300];
long from[300][40],to[300][40],at[300][40];
long printDetail(long i, long j)//递归输出
{
    if(j<=0||i<=0) return 1;
    long num=printDetail(from[i][j]-1,j-1);
    cout<<"Depot "<<num<<" at restaurant "<<at[i][j]<<" serves ";;
    if(from[i][j]==to[i][j]) cout<<"restaurant "<<from[i][j]<<endl;
    else cout<<"restaurants "<<from[i][j]<<" to "<<to[i][j]<<endl;
    return num+1;
}
int main()
{
    long n,K,i,j,k,middle,min,get,c=1;
    while(cin>>n>>K&&(n||K))
    {
        for(i=1;i<=n;i++) cin>>r[i];
        memset(one,0,sizeof(one));
        memset(sum,0,sizeof(sum));
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                middle=(i+j)/2;
                for(k=i;k<middle;k++)
                   one[i][j]+=r[middle]-r[k];
                for(k=middle+1;k<=j;k++)
                    one[i][j]+=r[k]-r[middle];
            }
        }
        for(i=1;i<=n;i++) sum[i][0]=MAX;
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=i&&j<=K;j++)
            {
                sum[i][j]=MAX;
                for(k=j-1;k<=i-1;k++)
                {
                    get=sum[k][j-1]+one[k+1][i];
                    if(get<sum[i][j])
                    {
                        sum[i][j]=get;
                        from[i][j]=k+1;
                        to[i][j]=i;
                        at[i][j]=(k+1+i)/2;
                    }//记录动态规划路径
                }
            }
        }
        cout<<"Chain "<<c++<<endl;
        printDetail(n,K);
        cout<<"Total distance sum = "<<sum[n][K]<<endl<<endl;
    }
    return 0;
}