【ACwing】一、二分：整数、小数二分模板+789. 数的范围+790. 数的三次方根

(1)整数二分模板

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

// 区间[l, r]被划分成[l, mid]和[mid + 1, r]时使用：
int bsearch_1(int l, int r)
{
    while (l < r)
    {
        int mid = l + r >> 1;
        if (check(mid)) r = mid;    // check()判断mid是否满足性质
        else l = mid + 1;
    }
    return l;
}
// 区间[l, r]被划分成[l, mid - 1]和[mid, r]时使用：
int bsearch_2(int l, int r)
{
    while (l < r)
    {
        int mid = l + r + 1 >> 1;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    return l;
}

(2)整数二分例子——789. 数的范围

输入样例：

6 3
1 2 2 3 3 4
3
4
5

输出样例：

3 4
5 5
-1 -1

# include <iostream>

using namespace std;

const int N = 100010;

int q[N];
int m,n,x;

int main()
{
    scanf("%d %d",&n,&m);
    for(int i = 0; i < n; i ++)
        scanf("%d",&q[i]);
    while(m--)
    {
        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<<' ';
            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;
            }
            cout<<l<<endl;
        }
        
    }
    return 0;
}

(3)小数二分模板

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

double bsearch_3(double l, double r)
{
    const double eps = 1e-6;   // eps 表示精度，取决于题目对精度的要求
    while (r - l > eps)
    {
        double mid = (l + r) / 2;
        if (check(mid)) r = mid;
        else l = mid;
    }
    return l;
}

(4)整数二分例子——790. 数的三次方根

# include <iostream>

using namespace std;

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