UVa 10066 - The Twin Towers

原创于 2013-06-13 21:14:18 发布 · 460 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#UVa #The Twin Towers

uva 专栏收录该内容

34 篇文章

订阅专栏

本文提供了一种解决UVa10066-TheTwinTowers问题的Java实现方案。该方案使用动态规划算法来找出两组塔楼中可以匹配的最大瓷砖数量。通过读取输入数据并进行处理，程序能够有效地计算出解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*
 * UVa 10066 - The Twin Towers
 * */
import java.util.Scanner;

class TheTwinTowers {

	public static void main(String[] args) {
		int n1, n2;
		Scanner scanner = new Scanner(System.in);
		int count = 0;
		while ((n1 = scanner.nextInt()) != 0 && (n2 = scanner.nextInt()) != 0) {
			count++;
			int[] x = new int[n1 + 1];
			int[] y = new int[n2 + 1];
			for (int i = 1; i <= n1; i++)
				x[i] = scanner.nextInt();
			for (int i = 1; i <= n2; i++)
				y[i] = scanner.nextInt();
			int[][] c = new int[n1 + 1][n2 + 1];
			for (int i = 1; i <= n1; i++) {
				for (int j = 1; j <= n2; j++) {
					if (x[i] == y[j])
						c[i][j] = c[i - 1][j - 1] + 1;
					else if (c[i - 1][j] >= c[i][j - 1])
						c[i][j] = c[i - 1][j];
					else
						c[i][j] = c[i][j - 1];
				}
			}
			System.out.println("Twin Towers #" + count);
			System.out.println("Number of Tiles : " + c[n1][n2]);
			System.out.println();
		}
	}
}