编程之美热身赛 题目3 : 树上的三角形

package TriangleOnTree;

import java.io.BufferedInputStream;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {
	int[][] node;
	String[] startEnd;
	ArrayList<Integer> values;
	int visit[];
	ArrayList<Integer> stack;
	boolean b;
	public Main(int[][] node, String[] startEnd) {
		this.node = node;
		this.startEnd = startEnd;
	}

	public void calc() {
		for (int i = 0; i < startEnd.length; i++) {
			// 初始化
			visit = new int[node[0].length];
			values = new ArrayList<Integer>(node[0].length - 1);
			stack = new ArrayList<Integer>();

			int start = Integer.parseInt(startEnd[i].split(" ")[0]) - 1;
			int end = Integer.parseInt(startEnd[i].split(" ")[1]) - 1;
			this.path(start, end);

//			System.out.println(i + ":");
//			for (Integer v : values) {
//				System.out.println(v);
//			}

			this.isTriangle();

		}
	}

	public void isTriangle() {
		boolean flag = false;
		int n = values.size();
		if (n >= 3) {
			A: for (int i = 0; i < n - 2; i++) {
				for (int j = i + 1; j < n - 1; j++) {
					for (int k = j + 1; k < n; k++) {
						int a = pd(values.get(i), values.get(j), values.get(k));
						int b = pd(values.get(i), values.get(k), values.get(j));
						int c = pd(values.get(j), values.get(k), values.get(i));
						int tmp = a + b + c;
						if (tmp == 3) {
							flag = true;
							break A;
						}
					}
				}
			}
		}
		if (flag)
			System.out.println("Yes");
		else
			System.out.println("No");
	}

	int pd(int a, int b, int c) {
		int k = a + b;
		if (k > c)
			return 1;
		else
			return 0;
	}

	public void path(int start, int end) {

		for (int j = 0; j < node[start].length; j++) {
			b = false;
			// System.out.println("node["+start+"]["+j+"]:"+node[start][j]);
			if (node[start][j] != 0 && visit[j] == 0 && visit[start] == 0) {
				visit[start] = 1;
				if (j != end) {
					values.add(node[start][j]);
					stack.add(start);
					path(j, end);
					if(b)
						return ;
				} else {
					b = true;
					values.add(node[start][j]);
					break;
				}
			} else {
				if (j == node[start].length - 1) {
					visit[start] = 1;
					visit[stack.get(stack.size() - 1)] = 0;
					stack.remove(stack.size() - 1);
					values.remove(values.size() - 1);
				}
			}
		}
	}

	public static void main(String[] args) {
		Scanner cin = new Scanner(new BufferedInputStream(System.in));

		// 数据组数
		int num = cin.nextInt();
		cin.nextLine();

		for (int i = 0; i < num; i++) {
			// 节点个数
			int NodeNum = cin.nextInt();
			int[][] node = new int[NodeNum][NodeNum];
			cin.nextLine();
			for (int j = 1; j < NodeNum; j++) {
				int start = cin.nextInt();
				int end = cin.nextInt();
				int value = cin.nextInt();
				// System.out.println("node["+ (start-1) +"]["+ (end-1)
				// +"]:"+value);
				cin.nextLine();
				// System.out.println(start);
				// System.out.println(end);
				node[start - 1][end - 1] = value;
				node[end - 1][start - 1] = value;
			}
			int TestNum = cin.nextInt();
			cin.nextLine();
			String[] startEnd = new String[TestNum];
			for (int j = 0; j < TestNum; j++) {
				startEnd[j] = cin.nextLine();
			}
			System.out.println("Case #" + (i + 1) + ":");
			Main tot = new Main(node, startEnd);
			tot.calc();
		}
		cin.close();
	}

}