蓝桥-二分专题

一，分巧克力

题目链接：http://lx.lanqiao.cn/problem.page?gpid=T2829

import java.util.Scanner;

public class 分巧克力 {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int k = scanner.nextInt();
		int[][] choc = new int[n][2];
		int max = Integer.MIN_VALUE;
		
		for(int i = 0; i < n; i++){
			for(int j = 0; j < 2; j++) {
				choc[i][j] = scanner.nextInt();
				max = Math.max(max, choc[i][j]);
			}
		}
		int left = 1;
		int right = 100000;
		//二分
		while(left <= right) {
			int mid = left + (right - left) / 2;
			//这个k限定值，可以直接放到函数中参与判断，不用再返回值在if里单独判断。
			if(check(choc, mid, k)) left = mid + 1;
			else {
				right = mid - 1;
			}
		}
		System.out.println(right);
//		这种枚举，会超时。会过一部分样例。数据大，可能爆int，不会提示超时。不爆int会提示超时。
//		int num = 1;
//		for(int i = 2; i <= max; i++) {
//			long sum = 0;
//			for(int j = 0; j < n; j++) {
//				sum = sum + (choc[j][0] / i) * (choc[j][1] / i);
//			}
//			if(sum < k) {
//				break;
//			}
//			if(sum >= k) {
//				num = i;
//			}
//		}
//		System.out.println(num);
	}
	static boolean check(int[][] choc, int mid, int k) {
		int sum = 0;
		for(int j = 0; j < choc.length; j++) {
			sum = sum + sum + (choc[j][0] / mid) * (choc[j][1] / mid);
		}
		return sum >= k;
	}
}

改进的统一二分形式写法（二分搜左右边界答案）：

package 二分;

import java.util.Scanner;

public class 分巧克力 {
	static int[][] nums;
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int k = scanner.nextInt();
		nums = new int[n][2];
		for(int i = 0; i < n; ++i) {
			nums[i][0] = scanner.nextInt();
			nums[i][1] = scanner.nextInt();
		}
		//二分
		int left = 1;
		int right = 100000;
		while(left <= right) {
			int mid = left + ((right - left) >> 1);
			int tmp = check(mid);
			if(tmp < k) {
				right = mid - 1;
			}else if(tmp >= k) {
				left = mid + 1;
			}
		}
		//判断右侧边界的问题。是否越界，是否没动？？
		if(right < 1 || check(right) < k) {
			System.out.println(-1);
		}else {
			System.out.println(right);
		}
		
	}
	public static int check(int mid) {
		int count = 0; 
		for(int i = 0; i < nums.length; ++i) {
			count += (nums[i][0] / mid ) * (nums[i][1] / mid);
		}
		return count;
	}
	
}

二，打包（二分搜左右边界答案）

http://lx.lanqiao.cn/problem.page?gpid=T2978

package 二分;

import java.util.Scanner;

public class 打包 {
	static int n;
	static int m;
	static int[] nums;
	public static void main(String[] args) {
		//二分 + 技巧(题意理解）
		//1,考虑左右边界
		//2,考虑check函数
		Scanner scanner = new Scanner(System.in);
		n = scanner.nextInt();
		m = scanner.nextInt();
		nums = new int[n];
		int sum = 0;
		int max = 0;
		for(int i = 0; i < n; ++i) {
			nums[i] = scanner.nextInt();
			max = Math.max(max, nums[i]);
			sum += nums[i];
		}
		int left = max;
		int right = sum;
		while(left <= right) {
			int mid = left + ((right  - left) >> 1);
			int count = check(mid);
			if(count > m) {
				left = mid + 1;
			}else if(count <= m) {
				right = mid - 1;
			}
		}
		//搜索左边界
		if(left > sum || check(left) > m) {
			System.out.println(-1);
		}else {
			System.out.println(left);
		}
	}
	
	static int check(int mid) {
		int countm = 0;
		int sum = 0;	
		for(int i = 0; i < n; ++i) {
			sum += nums[i];
			//if elseif 只要满足了前面的，即使满足else if的条件，也不会执行的
			//if if 结构条件都满足都会执行。
			if(sum > mid) {
				++ countm;																									
				sum = 0;
				-- i;				//这里一定要--i，因为加上这个数后，大于了限定值，则必须放到下一个包裹里。
			}else if(i == n - 1) {							
				++ countm;
			}
		}
		return countm;
	}
}