找券网站怎么做wordpress 追格时光轴购物主题

由题目可知,该题的最终结果具有单调性,边长越大,可分蛋糕越少

可以用二分模板的向右找:  整数二分

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;public class Main {static int n,k;  //n个块蛋糕,k个学生static int N = 100010;static int[] h = new int[N]; //分别表示宽和高static int[] w = new int[N];static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));public static void main(String[] args)throws IOException {String[] init = in.readLine().split(" ");n = Integer.parseInt(init[0]);k = Integer.parseInt(init[1]);for(int i = 0;i < n; i ++) {  //存储蛋糕长宽init = in.readLine().split(" ");h[i] = Integer.parseInt(init[0]);w[i] = Integer.parseInt(init[1]);}//用二分的向右找模板,找一个 <= 正确结果的 的最大值int l = 1,r = 100000;while(l < r) {int mid = l + r + 1 >> 1;if(check(mid)) l = mid;else r = mid - 1;}System.out.println(l);in.close();
}public static boolean check(int mid) {    //mid代表切下来的边长int res = 0;for(int i = 0;i < n;i ++) {res += (h[i] / mid) * (w[i] / mid);if(res >= k) return true;   //满足条件了就可以退出,可以算剪枝}return false;}
}