lower_bound和upper_bound的另一种写法

    int lower_bound(int A[], int n, int target)    {        int left = 0, right = n-1;        while(left <= right)        {            int mid = left+(right-left)/2;            if(A[mid] < target)                left = mid+1;            else                right = mid-1;        }        return right+1;    }        int higher_bound(int A[], int n, int target)    {        int left = 0, right = n-1;        while(left <= right)        {            int mid = left+(right-left)/2;            if(A[mid] <= target)                left = mid+1;            else                right = mid-1;        }        return right+1;    }