动态规划--装配线调度问题

 

#include<stdio.h>
#include<stdlib.h>
void Fastest_Way(int * a, int n, int * t, int * e, int * x)
{//定义一个二维数组a[2][n]，二维数组t[2][n-1]
 //定义一位数组e[2],x[2]; 
     int f[2][n];  
     int l[2][n];
     int F, L;
     f[0][0] = e[0] + *(a);   //开始进入装配线1 
     f[1][0] = e[1] + *(a + n); //开始进入装配线2 
     for(int j = 1; j < n; j++)
     {
           if((f[0][j - 1] + *(a + j)) <= (f[1][j - 1] + *(t + n - 1 + j - 1) + *(a + j)))
           {
                      f[0][j] = f[0][j - 1] + *(a + j);
                      l[0][j] = 1;           
           }          
           else
           {
                      f[0][j] = f[1][j - 1] + *(t + n - 1 + j - 1) + *(a + j); 
                      l[0][j] = 2;
           }
           if((f[1][j - 1] + *(a + n + j)) <= (f[0][j - 1] + *(t + j - 1) + *(a + n + j)))
           {
                      f[1][j] = f[1][j - 1] + *(a + n + j);
                      l[1][j] = 2;         
           }
           else 
           {
                      f[1][j] = f[0][j - 1] + *(t + j - 1) + *(a + n + j);
                      l[1][j] = 1;     
           }
     }
     if((f[0][n - 1] + x[0]) <= (f[1][n - 1] + x[1]))
     {
                F = f[0][n - 1] + x[0];
                L = 1;               
     }
     else
     {
                F = f[1][n - 1] + x[1];
                L = 2;    
     }
     int i = L;
     printf("line %d station %d\n",i, n);
     for(int j = n - 1; j >= 1; j--)
     {
             i = l[i - 1][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((int *)A, 6, (int *)T, E, X);
    system("pause");
    return 0;    
}