mark hdu 1227

仍然找不到错误在哪里

：

我的：

#include<cstdio>
#include<cstring>
#include<cmath>
int n,k;
int d[205][205];
int dis[205];
int s[205][205];
int min(int x,int y)
{
 return x<y?x:y;
}
int dp(int x,int y)//代表到第x个商店 一共有y个depot
{
 if(x!=0&&y==1) return s[0][x];
 if(x==0) return 0;
 if(d[x][y]) return d[x][y];
 //d[x][y]=min(dp(x-1,y),dp(x-1,y-1))
    int k;
 d[x][y]=999999;
 for(k=0;k<x;k++)
 {
  d[x][y]=min(d[x][y],dp(k,y-1)+s[k+1][x]);
 }
 return d[x][y];
}
int main()
{
 while(scanf("%d %d",&n,&k)==2&&!(n==0&&k==0))
 {
 int i,j,k2;
 for(i=0;i<n;i++)
 {
  scanf("%d",&dis[i]);
 }
    memset(d,0,sizeof(d));
    memset(s,0,sizeof(s));
 for(i=0;i<n;i++)
 {
  for(j=0;j<n;j++)
  {
   int point=10*(dis[i]+dis[j])/2;
   for(k2=i;k2<=j;k2++)
    s[i][j]+=abs(dis[k2]*10-point);
   s[i][j]/=10;
  }
 }
 printf("%d\n",dp(n-1,k));
 }
 return 0;
}

对的：

#include<stdio.h>
#include<string.h>
#define N 205
#define M 35
#define inf 2000000000
int dp[N][M],w[N][N],a[N],s[N][M];
int main()
{
    int m,n,t,i,j,k,last,cas=0;
    while (scanf("%d%d",&n,&m))
    {
        cas++;
        if (n==0 && m==0) break;
        memset(dp,0,sizeof(dp));
        memset(s,0,sizeof(s));
        memset(w,0,sizeof(w));
        for (i=1;i<=n;++i) scanf("%d",&a[i]);
        for (j=0;j<n;++j)
        {
            for (i=1;i<=n-j;++i)
            {
                t=i+j;
                if (j==0) w[i][t]=0;
                else
                if (j%2==0)
                {
                    w[i][t]=w[i][t-1]+(a[t]-a[(i+t-1)/2+1]);
                }
                else
                {
                    w[i][t]=w[i+1][t]+(a[(i+1+t)/2]-a[i]);
                }
            }
        }
        for (i=1;i<=n;++i) dp[i][0]=w[1][i];
        for (i=1;i<=n;++i)
        {
            last=0;
            for (j=1;j<=(m<i?m:i);++j)
            {
                if (j==1) {dp[i][j]=w[1][i];continue;}
                dp[i][j]=inf;
                for (k=s[i][j-1];k<i;++k)
                {
                    if (dp[k][j-1]+w[k+1][i]<dp[i][j])
                    {
                        dp[i][j]=dp[k][j-1]+w[k+1][i];
                        s[i][j]=k;
                    }
                }
            }
        }
        printf("Chain %d/n",cas);
        printf("Total distance sum = %d/n/n",dp[n][m]);
    }
    return 0;
}