记一次邪门“二分答案”P1873砍树（java实现）

记一次邪门“二分答案”P1873砍树（java实现）

首先做了几个二分的题了啦，总结一下二分法的KEY：

• while循环
• 循环内判断左缩还是右缩的条件
• 左右中三点进行二分
• 关键是无论左缩还是右缩神奇之处是会缩成一个数即left==right即满足while跳出
• 一般会用到快读

			while(【l<r】){		
				int mid = l+(r-l)/2；
				if(【】){
					r=【】;
				}else{
					l = mid+1;
				}
			}
			if(【judge】){
				System.out.print();
			}else{
				System.out.print();
			}

md这个题气死了55，思路和c++的一样，好么，10分，tle加wa，好！我的问题，学习搜索java实现修改细节后得

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;

public class Main{
	public static void main(String[] args) throws IOException {
		StreamTokenizer st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		st.nextToken();
		int n = (int) st.nval;
		st.nextToken();
		int m = (int) st.nval;
		int max=0;
		int arr[] = new int[n];
		for (int i = 0; i < n; i++) {
			st.nextToken();
			arr[i]=(int) st.nval;
			max=Math.max(max, arr[i]);
		}
		int left=0;
		int right=max;
		while(left<=right){
			int sum=0;
			int mid = (left+right)/2;
			for (int i = 0; i < n; i++) {
				if(mid<arr[i]){
					sum+=arr[i]-mid;
				}
			}
			if(sum>=m){//错了个符号
				left=mid+1;
			}else{
				right=mid-1;
			}
		}
		System.out.println(left-1);
		
	}
}

70分！！wa3个点！！

对比一下大佬的代码

package home.BinarySearch;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class 砍树 {

	public static void main(String[] args) throws IOException {	
	    StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	    PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
	    in.nextToken();
	    int n = (int)in.nval;
	    in.nextToken();
	    int m = (int)in.nval;
	    int[] s = new int[n];
	    int l = 0,r = 0;
	    for(int i = 0;i < n;i++) {
	    	in.nextToken();
	    	s[i] = (int)in.nval;
	    	r = Math.max(r, s[i]);
	    }
	    while(l <= r) {
	    	int mid = (l + r) / 2;
	    	if(judge(mid,s,m)) {
	    		l = mid + 1;
	    	}else {
	    		r = mid - 1;
	    	}
	    }
	    out.print(l - 1);
	    out.close();
	}
	
	public static boolean judge(int mid,int[] s,int m) {
		int sum = 0;
		for(int i = 0;i < s.length;i++) {
			if(s[i] > mid) {
				sum += (s[i] - mid);
				if(sum >= m) {
					return true;
				}
			}
		}
		return false;
	}
}

仔细N次比对，发现仅仅是方法的分离！不死心，下载数据点测试，，，发现输出 -1 !!!

哎，，改成函数调用就可以···至今没想明白，睡觉！！！