![](https://i-blog.csdnimg.cn/blog_migrate/8bbd0dbefd8e36f1d2209678614ef590.png)
要求得到装配最快的时间和装配的路径。输入:六个一维数组。输出:最短的耗时以及经过的装配线站点。直接给代码
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
public class FastWay {
private int[] e=new int[2];
private int[] x=new int[2];
private int[] a1=new int[10];
private int[] a2=new int[10];
private int[] t1=new int[9];
private int[] t2=new int[9];
private int[] f1=new int[10];
private int[] f2=new int[10];
private int[] l1=new int[10];
private int[] l2=new int[10];
private static int af;
private static int al;
private int length=a1.length+a2.length+t1.length+t2.length;
public void Write() throws IOException{
Scanner sc=new Scanner(System.in);
System.out.println("请输入到第一条装配线的搬运时间:");
int e1=sc.nextInt();
System.out.println("请输入到第二条装配线的搬运时间:");
int e2=sc.nextInt();
e[0]=e1;
e[1]=e2;
System.out.println("请输入第一条装配线完成离开的搬运时间");
int x1=sc.nextInt();
System.out.println("请输入第二条装配线完成离开的搬运时间");
int x2=sc.nextInt();
x[0]=x1;
x[1]=x2;
int num;
int[] x=new int[length];
//循环生成随机数,存到数组x中
for(int i=0;i<length;i++){
num=(int) (Math.random()*10);
x[i]=num;
}
File file=new File("D:\\in.txt");
FileWriter out = new FileWriter(file);
//循环将数组写入文件
for(int i=0;i<length;i++){
out.write(x[i]+"\t");
}
out.close();
}
public void Read() throws IOException{
int[] b=new int[length];
File file=new File("D:\\in.txt");
BufferedReader in=new BufferedReader(new FileReader(file));
String line=in.readLine();
String[] temp=line.split("\t");
//循环将文件中值赋给数组
for(int j=0;j<temp.length;j++){
b[j]=Integer.parseInt(temp[j]);
}
for(int j=0;j<a1.length;j++){
a1[j]=b[j];
System.out.print(a1[j]+"\t");
}
System.out.println();
for(int j=0;j<a2.length;j++){
a2[j]=b[j+a1.length];
System.out.print(a2[j]+"\t");
}
System.out.println();
for(int j=0;j<t1.length;j++){
t1[j]=b[j+a1.length+a2.length];
System.out.print(t1[j]+"\t");
}
System.out.println();
for(int j=0;j<t2.length;j++){
t2[j]=b[j+a1.length+a2.length+t1.length];
System.out.print(t2[j]+"\t");
}
System.out.println();
in.close();
}
public void findFasyWay(){
f1[0]=e[0]+a1[0];
f2[0]=e[1]+a2[0];
l1[0]=1;
l2[0]=2;
//循环计算到下一个站点的最短时间
for(int j=1;j<a1.length;j++){
if(f1[j-1]+a1[j]<=f2[j-1]+t2[j-1]+a1[j]){
f1[j]=f1[j-1]+a1[j];
l1[j]=1;
}else{
f1[j]=f2[j-1]+t2[j-1]+a1[j];
l1[j]=2;
}
if(f2[j-1]+a2[j]<=f1[j-1]+t1[j-1]+a2[j]){
f2[j]=f2[j-1]+a2[j];
l2[j]=2;
}else{
f2[j]=f1[j-1]+t1[j-1]+a2[j];
l2[j]=1;
}
}
//最后比较两条装配线的最短耗时。
if(f1[9]+x[0]<f2[9]+x[1]){
af=f1[9]+x[0];
al=1;
}else{
af=f2[9]+x[1];
al=2;
}
for(int i=0;i<f1.length;i++){
System.out.print(f1[i]+"\t");
}
System.out.println();
for(int i=0;i<f2.length;i++){
System.out.print(f2[i]+"\t");
}
System.out.println();
for(int i=0;i<l1.length;i++){
System.out.print(l1[i]+"\t");
}
System.out.println();
for(int i=0;i<l2.length;i++){
System.out.print(l2[i]+"\t");
}
System.out.println();
System.out.println();
System.out.println("最短时间为"+af);
System.out.println("最后的装配线号为"+al);
}
public static void main(String[] args) throws IOException{
FastWay fw=new FastWay();
fw.Write();
fw.Read();
fw.findFasyWay();
File file1=new File("D:\\result.txt");
FileWriter out1 = new FileWriter(file1);
out1.write("最短时间为"+af+"最后的装配线号为"+al);
out1.close();
}
}