学步园

double Shortest(int n,double **t,double **s){
    {
    for(int i=1; i<=n; i++)
    {
        t[i][i] = 0;
    }
    for(int r=2; r<=n; r++)
    {
        for(int i=1; i<=n-r+1; i++)
        {
            int j = i+r-1;

            t[i][j] = t[i+1][j] + Length(i-1,i,j);

            s[i][j] = i;

            for(int k=i+1; k<j; k++)
            {
                int u = t[i][k] + t[k+1][j] + Length(i-1,k,j);
                if(u<t[i][j])
                {
                    t[i][j] = u;
                    s[i][j] = k;
                }
            }
        }
    }
    return t[1][z-1];
}
}