我的c\c++之旅（七）

钢条切割

/* 带备忘的自顶向下法 */
#define max(a,b) (a) > (b) ? (a) : (b)

int memo_cut_rod_aux(int *p, int n, int *r)
{
    int value, i;

    if(r[n] > 0)
        return r[n];
    value = 0;
    if(n > 0)
        for(i = 1; i <= n; i++)
            value = max(value, p[i]+memo_cut_rod_aux(p, n-i, r));
    r[n] = value;
    return r[n];
}

int memo_cut_rod(int *p, int n)
{
    int *r, value, i;

    r = (int*)malloc(sizeof(int) * (n+1));
    for(i = 0; i <= n; i++)
        r[i] = 0;
    value = memo_cut_rod_aux(p, n, r);
    free(r);
    return value;
}

/* 自底向上法 */
#define max(a,b) (a) > (b) ? (a) : (b)

int bottom_up_cut_rod(int *p, int n)
{
    int *r, value, i, j;

    r = (int*)malloc(sizeof(int) * (n+1));
    r[0] = 0;

    for(i = 1; i <= n; i++) {
        value = 0;
        for(j = 1; j <= i; j++)
            value = max(value, p[j]+r[i-j]);
        r[i] = value;
    }   
    free(r);
    return value;
}