二分模板(整数、浮点数)

二分：

整数模板：

Bool check(){

      

}

       while(l < r){//求最大

              int mid = (l+r)/2+1;//左侧为满足条件，所以mid取较右进行判断

              if(judge(mid)){

                     l = mid;//l始终满足条件

              }

              else{

                     r = mid-1;//不满足条件 应在不满足条件的左侧一位。

              }

       }

       cout << l << endl;//最终l r无所谓。

       while (l < r){//求最小

        int mid = l + r >> 1;//右侧为满足条件，所以mid取较左进行判断

        if (check(mid)) r = mid; 

        else l = mid + 1;

    }

cout << l << endl;

浮点数模板：

bool check(double x) {/* ... */} // 检查x是否满足某种性质



double bsearch_3(double l, double r)

{

    const double eps = 1e-6;  // eps 表示精度，取决于题目对精度的要求

    while (r - l > eps)//如果让你保留四位小数，则eps写成1e-6;如果是保留五位小数，则eps写成1e-7

    {

        double mid = (l + r) / 2;

        if (check(mid)) r = mid;

        else l = mid;//不需要处理边界了

    }

    return l;

}

              while(fabs(r-l) > ESP){

                     mid = (r+l)/2.0;

                     if(!check(mid)){

                            r = mid;

                     }

                     else {

                            l = mid;

                     }     

              }

              printf("%.4lf\n",mid);

直接判断即可，无非就是要最大值check满足就变l，要最小值check满足就变r，最终输出应为mid。

例题：

#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<queue>
#include<map>
#include<cstdio>
#include<cmath>
#include<stdlib.h>

using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 1e6+50;
ll arr[maxn];
int a,b;
bool check(ll mid){
	ll before = arr[1];
	int cnt = 1;
	for(int i = 2;i <= a;i++){
		if(arr[i]-before >= mid){
			before = arr[i];
			cnt++;
		}	
	}
	if(cnt >= b) return true;
	return false;
}
int main(){
	cin >> a >> b;
	for(int i = 1;i <= a;i++)	cin >> arr[i];
	sort(arr+1,arr+a+1);
	ll l = 0,r = arr[a]-arr[1];
	ll mid;
	while(l < r){
		int mid = (l+r)/2+1;
		if(check(mid)){
			l = mid;
		}
		else{
			r = mid-1;
		}
	}
	cout << l;
	return 0;
}