【备战蓝桥杯】

---

二分

二分的本质是： 找到一个边界，能够使得，边界两边的元素有着不同的性质。

---

一、模板一

		int l = 0, r = n - 1;
        while(l < r)
        {
            int mid = l + r >> 1;
            if(q[mid] >= x) r = mid;	// 边界性质，
            else l = mid + 1;
        }

二、模板二

			int l = 0, r = n - 1;
            while(l < r)
            {
                int mid = l + r + 1>> 1;
                if(q[mid] <= x) l = mid;
                else r = mid - 1;
            }

---

三、例题

找到一个数字的左边界和右边界

#include<iostream>
using namespace std;

const int N = 100010;
int q[N];

int main()
{
    int n, m;
    cin>>n>>m;
    for(int i = 0; i < n; i ++) scanf("%d", &q[i]);
    
    while(m--)
    {
        int x;
        scanf("%d", &x);
        
        int l = 0, r = n - 1;
        while(l < r)
        {
            int mid = l + r >> 1;
            if(q[mid] >= x) r = mid;
            else l = mid + 1;
        }
        if(q[l] != x) cout<<"-1 -1"<<endl;
        else
        {
            cout<<l<<' ';
            l = 0, r = n - 1;
            while(l < r)
            {
                int mid = l + r + 1>> 1;
                if(q[mid] <= x) l = mid;
                else r = mid - 1;
            }
            cout<<l<<endl;
        }
    }
    
    return 0;
}

求一个数的三次方根

#include<iostream>
using namespace std;

int main()
{
    double n;
    cin>>n;
    
    double l = -22;
    double r = 22;
    
    while(r - l > 1e-8)
    {
        double mid = (l + r) / 2;
        if(mid * mid * mid >= n) r = mid;
        else l = mid;
    }
    
    printf("%.6lf", l);
    
    return 0;
}