运用四边形技巧的动态规划算法

问题

3.有0-N层，地面算第0层，最高的一层为第N层。已知棋子从第0层掉落肯定不会摔碎，从第i层掉落可能回摔碎也可能不会摔碎（1<=i<=N）给定整数N作为楼层数，再给定整数k作为棋子数，返回如果想找到棋子不会摔碎的最高楼层，即使最差劲的情况下扔的最少次数，一次只能扔一个
示例
第一行输入测试用例的数量
第二行输入 楼层层数和硬币个数
input:1
input:3 2
output: 2

思想
动态规划表是二维的楼层数和棋子数的二维表。dp值保存该层楼该颗棋子仍几次的值。 加一个best值优化，假如100层楼3颗棋子在15楼处得到最优解，则best[100][3]=15

代码

package class17;

import java.awt.geom.AffineTransform;
import java.util.Scanner;

import javax.naming.InitialContext;

public class Code02_ThrowChessPiecesProblem {
	
	public static int superEggDrop1(int nlevel,int kchess) {
		if(kchess < 1||nlevel<1) return 0;
		int ans = process(nlevel,kchess);
		return ans;
	}
	public static int  process(int n,int k) {
		if(k == 1) return n;
		if(n == 0) return 0;
		int ans = 0;
		for(int i =1;i<=n;i++) {
			ans = Math.min(ans,Math.max(process(i-1, k-1), process(n-i, k)));
		}
		return ans+1;
	}
	public static int superEggDrop2(int nlevel,int kchess) {
		if(kchess < 1||nlevel<1) return 0;
		if(kchess == 1) return nlevel;
		int[][] dp = new int[nlevel+1][kchess+1];
		for(int i = 1;i<=nlevel;i++) {
			dp[i][1] = i;
		}
		for(int i =1;i<=nlevel;i++) {
			for(int j = 2;j<=kchess;j++) {
				int min = Integer.MAX_VALUE;
				for(int level = 1;level!=i+1;level++) {
					min = Math.min(min, Math.max(dp[level-1][j-1], dp[i-level][j]));
				}
				dp[i][j] = min+1;
			}
		}
		return dp[nlevel][kchess];
	}
	public static int superEggDrop3(int nlevel,int kchess) {
		if(kchess < 1||nlevel<1) return 0;
		if(kchess == 1) return nlevel;
		int[][] dp = new int[nlevel+1][kchess+1];
		// 存储当前位置停留的楼层数
		int[][] best = new int[nlevel+1][kchess+1];
		for(int i = 1;i<=nlevel;i++) {
			dp[i][1] = i;
		}
		for(int i = 1;i<=kchess;i++) {
			dp[1][i] = 1;
			best[1][i] = 1;
		}
		for(int i =1;i<=nlevel;i++) {
			for(int j = 2;j<=kchess;j++) {
				int choose = -1;
				int min = Integer.MAX_VALUE;
				int first = best[i-1][j];
				int end = j == kchess? i:dp[i][j+1];
				for(int level = first;level!=end+1;level++) {
					int ans =  Math.max(dp[level-1][j-1], dp[i-level][j]);
					if(min<ans) {
						min = ans;
						choose = level;
					}
				}
				dp[i][j] = min+1;
				best[i][j] = choose;
			}
		}
		return dp[nlevel][kchess];
	}
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int N = Integer.parseInt(scanner.nextLine());
		while(N-->0) {
			int Nlevel = scanner.nextInt();
			int Kchess = scanner.nextInt();
			int ans1 = superEggDrop1(Nlevel, Kchess);
			int ans2 = superEggDrop2(Nlevel, Kchess);
			int ans3 = superEggDrop3(Nlevel, Kchess);
			if(ans1!=ans2||ans2!=ans3) {
				System.out.println("出错了");
			}
			System.out.println(ans3);
		}

	}

}