poj1860之java实现

最新推荐文章于 2021-02-15 15:08:51 发布

Duke700

最新推荐文章于 2021-02-15 15:08:51 发布

阅读量680

点赞数

分类专栏： ACM 文章标签： POJ java 算法

本文链接：https://blog.csdn.net/firechungelaile/article/details/23369013

版权

ACM 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

题目分析可从我的另外一篇博文poj1860解题报告中查看，java试水之作，如有不妥之处请见谅。

附测试数据：

3 2 1 20.0
1 2 1.00 1.00 1.00 1.00
2 3 1.10 1.00 1.10 1.00

//4564K	3188MS
import java.util.Arrays;
import java.util.Scanner;

import org.omg.CORBA.DoubleSeqHolder;
import org.omg.CORBA.PUBLIC_MEMBER;

public class Main {

	Scanner cin = new Scanner(System.in);
	int  v, e, sour;
	double startMoney;
	Edge[] eEdgeInfo;
	double[] dDistance;
	
	public void input()
	{
		int k =0;
		int a,b;
		double rab,cab,rba,cba;
		//System.out.println("输入问题初始化数据");
		v =cin.nextInt();
		e = cin.nextInt();
		sour = cin.nextInt();
		startMoney = cin.nextDouble();
		eEdgeInfo = new Edge[e*2];
		dDistance = new double[v+2];
		Arrays.fill(dDistance, 0);
		dDistance[sour] = startMoney;		
		
		for (int i = 0; i < e; i++) {
			a = cin.nextInt();
			b = cin.nextInt();
			rab = cin.nextDouble();
			cab = cin.nextDouble();
			rba = cin.nextDouble();
			cba = cin.nextDouble();
			eEdgeInfo[k] = new Edge();
			eEdgeInfo[k].a =a;
			eEdgeInfo[k].b = b;
			eEdgeInfo[k].rate = rab;
			eEdgeInfo[k].commission = cab;
			k++;
			eEdgeInfo[k] = new Edge();
			eEdgeInfo[k].a =b;
			eEdgeInfo[k].b =a;
			eEdgeInfo[k].rate = rba;
			eEdgeInfo[k].commission = cba;
			k++;				
		}		
	}
	
	public int bellman_Ford() {
		input();
		int nflag = 0;
		int nChange = 0;
		double temp = 0;
		
		for (int i = 0; i < v-1; i++) {
			nChange = 0;
			for (int j = 0; j < e*2; j++) {
				temp = (dDistance[eEdgeInfo[j].a] - eEdgeInfo[j].commission)*eEdgeInfo[j].rate;
				if (dDistance[eEdgeInfo[j].b] < temp ) {
					dDistance[eEdgeInfo[j].b] =temp;
					nChange = 1;
					
				}
			}
			if (nChange == 0) {
				break;
			}
			
		}
		for (int j = 0; j < e*2; j++) {
			if (dDistance[eEdgeInfo[j].b] < (dDistance[eEdgeInfo[j].a] - eEdgeInfo[j].commission)*eEdgeInfo[j].rate) {
				nflag = -1;
				break;          //有正权回路
				
			}
		}
		

		return nflag;
	}
	
	public void solve()
	{
		while (cin.hasNext()) {
			int nFlag = bellman_Ford();
			if (nFlag == -1) {
				System.out.println("YES");
				
			}
			else {
				System.out.println("NO");
			}

		}
		
	}
	public static void main(String[] args){
		
		new Main().solve();
		
		//System.out.println("输入结束");
	}
	
	class Edge{
		public int a;
		public int b;
		public double rate;
		public double commission;
		
		
	}
}