算法导论；装配线调度

算法导论中关于装配线调度的C++实现，具体算法细节可参考《算法导论》一书：

代码如下：

#include
using namespace std;
int fastest_way(double **a,double **t,int n,double x1,double x2,double e1,double e2,int **l);
int print_stations(int **l,int l_,int n);
int main()
{
cout<<"输入装配站的数目："<<endl;
int n;
cin>>n;
double *a = new double[2];
for(int i = 0; i< 2; ++i)
{
a[i] = new double[n+1];
}
a[0][0] = 0;
a[1][0] = 0;
for(int i = 0; i< 2; ++i)
for(int j = 1; j < n+1; ++j)
{
cout<<"输入第"<<i+1<<"条装配线，"<<j<<"个装配站的时间量："<<endl;
cin>>a[i][j];
}
double **t = new double *[2];
for(int i = 0; i<