【动态规划】装配线调度代码

CLRS第二版15.1：

#include <stdio.h>

int f[2][101];
int l[2][101];
int ff;
int ll;

void fastest_way(int n, int a[2][n], int t[2][n-1], int e[2], int x[2])
{
    f[0][0] = a[0][0] + e[0];
    f[1][0] = a[1][0] + e[1];
    for(int j=1; j<n; j++)
    {
        if(f[1][j-1]+t[1][j-1]+a[0][j]<f[0][j-1]+a[0][j])
        {
            f[0][j] = f[1][j-1]+t[1][j-1]+a[0][j];
            l[0][j] = 1;
        }
        else
        {
            f[0][j] = f[0][j-1]+a[0][j];
            l[0][j] = 0;
        }
        if(f[0][j-1]+t[0][j-1]+a[1][j]<f[1][j-1]+a[1][j])
        {
            f[1][j] = f[0][j-1]+t[0][j-1]+a[1][j];
            l[1][j] = 0;
        }
        else
        {
            f[1][j] = f[1][j-1]+a[1][j];
            l[1][j] = 1;
        }
    }
    if(f[0][n-1]+x[0] <= f[1][n-1]+x[1])
    {
        ff = f[0][n-1]+x[0];
        ll = 0;
    }
    else
    {
        ff = f[1][n-1]+x[1];
        ll = 1;
    }
}

void print_station(int n, int ll)
{
    int i = ll;
    printf("line %d, station %d\n", i, n);
    for(int j=n-1; j>=1; j--)
    {
        i = l[i][j];
        printf("line %d, station %d\n", i, j);
    }
}

int main()
{
    int a[2][6] = {{7, 9, 3, 4, 8, 4},
                   {8, 5, 6, 4, 5, 7}};
    int t[2][5] = {{2, 3, 1, 3, 4},
                   {2, 1, 2, 2, 1}};

    int e[2] = {2, 4};
    int x[2] = {3, 2};
    fastest_way(6, a, t, e, x);

    printf("Total cost: %d\n", ff);
    print_station(6, ll);
    return 0;
}