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

  不想多说,关于这个.遗憾的是,没能够按照正序输出选择.只是算出了最小的代价.不着急,不久后会的.

---

// fastWay.cpp -- 2011-06-07-16.19#include "stdafx.h"#include <iostream>const char STATION_ONE = '1' ;const char STATION_TWO = '2' ;int fastestWay (int * * costOfProcess, int * * costOfMovement, const int s1, const int s2, const int e1, const int e2, const int lenth) ;int _tmain(int argc, _TCHAR* argv[]){int * * costOfProcess, * * costOfMovement ;int s1, s2, e1, e2, lenth ;s1 = 2 ;s2 = 4 ;e1 = 3 ;e2 = 2 ;lenth = 6; costOfProcess = new int *[2] ;costOfMovement = new int *[2] ;costOfProcess[0] = new int[lenth] ;costOfProcess[1] = new int[lenth] ;costOfMovement[0] = new int[lenth - 1] ;costOfMovement[1] = new int[lenth - 1] ;costOfProcess[0][0] = 7 ;costOfProcess[0][1] = 9 ;costOfProcess[0][2] = 3 ;costOfProcess[0][3] = 4 ;costOfProcess[0][4] = 8 ;costOfProcess[0][5] = 4 ;costOfProcess[1][0] = 8 ;costOfProcess[1][1] = 5 ;costOfProcess[1][2] = 6 ;costOfProcess[1][3] = 4 ;costOfProcess[1][4] = 5 ;costOfProcess[1][5] = 7 ;costOfMovement[0][0] = 2 ;costOfMovement[0][1] = 3 ;costOfMovement[0][2] = 1 ;costOfMovement[0][3] = 3 ;costOfMovement[0][4] = 4 ;costOfMovement[1][0] = 2 ;costOfMovement[1][1] = 1 ;costOfMovement[1][2] = 2 ;costOfMovement[1][3] = 2 ;costOfMovement[1][4] = 1 ;std ::cout << fastestWay (costOfProcess, costOfMovement, s1, s2, e1, e2, lenth) << std ::endl ;std ::cin.get () ;return 0 ;}int fastestWay (int * * costOfProcess, int * * costOfMovement, const int s1, const int s2, const int e1, const int e2, const int lenth){using std ::cout ;using std ::endl ;int * F1, * F2, endF ;char * L1, * L2, endL ;F1 = new int[lenth] ;F2 = new int[lenth] ;L1 = new char[lenth - 1] ;L2 = new char[lenth - 1] ;F1[0] = s1 + costOfProcess[0][0] ;F2[0] = s2 + costOfProcess[1][0] ;for (int i = 1; i < lenth; ++i){if (F1[i - 1] + costOfProcess[0][i] <= F2[i - 1] + costOfMovement[1][i - 1] + costOfProcess[0][i]){F1[i] = F1[i - 1] + costOfProcess[0][i] ;L1[i - 1] = STATION_ONE ;}else{F1[i] = F2[i - 1] + costOfMovement[1][i - 1] + costOfProcess[0][i] ;L1[i - 1] = STATION_TWO ;}if (F2[i - 1] + costOfProcess[1][i] <= F1[i - 1] + costOfMovement[0][i - 1] + costOfProcess[1][i]){F2[i] = F2[i - 1] + costOfProcess[1][i] ;L2[i - 1] = STATION_TWO ;}else{F2[i] = F1[i - 1] + costOfMovement[0][i - 1] + costOfProcess[1][i] ;L2[i - 1] = STATION_ONE ;}}if (F1[lenth - 1] + e1 <= F2[lenth - 1] + e2){endF = F1[lenth - 1] + e1 ;endL = STATION_ONE ;}else{endF = F2[lenth - 1] + e2 ;endL = STATION_TWO ;}delete []F1 ;delete []F2 ;delete []L1 ;delete []L2 ;return endF ;}