二分法相关

数组有序
寻找目标数字x

int maxn = 110;
int a[maxn];
int Binary(int left, int right, int x){
	int mid;
	while(left <= right) {
		mid = left + (right - left) / 2;
		if(a[mid] == x) return mid;
		else if(a[mid] > x) right = mid - 1;	// [left, mid)
		else left = mid + 1;					// (mid, right]
	}
	return -1;	// 最终没有找到相等
}

寻找第一个大于等于数字x的数字 "["

int lower_bound(int a[], int left, int right, int x){
	int mid;
	while(left < right) {			// left == right 可以是终点 即找到大于等于的数 
		mid = left + (right - left) / 2;
        if(a[mid] >= x) right = mid;	// 大于等于，则左侧仍可能有满足的
		else left = mid + 1;
	}
	return left;
}

寻找第一个大于数字x的数字 "("

int upper_bound(int a[]. int left, int right, int x){
	int mid;
	while(left < right) {			// left == right 可以是终点 即找到大于等于的数 
		mid = left + (right - left) / 2;
        if(a[mid] > x) right = mid;	// 大于，则左侧仍可能有满足的
		else left = mid + 1;
	}
	return left;
}

上述得出的位置-1即可得最后一个等于数字x的数字位置

模板：寻找有序序列中第一个满足条件的元素位置

int func(int a[]. int left, int right, int x){
	int mid;
	while(left < right) {
		mid = left + (right - left) / 2;
        if(条件) right = mid;	
		else left = mid + 1;
	}
	return left;
}

拓展：
求√2

const double eps = 1e-5;
double f(double x) {
	return x * x;
} 
double sqrt() {
	double left = 1, right = 2, mid;
	while(right - left > eps) {			// 精度要求是10^-5
		mid = left + (right - left) / 2;
		if(f(mid) > 2) right = mid; 	// mid > √2
		else left = mid;
	} 
	return mid;
}

求函数的根

const double eps = 1e-5;
double f(double x) {
	return 函数表达式;
} 
double sqrt(double left, double right) {
	double l = left, r = right, mid;
	while(right - left > eps) {			// 精度要求是10^-5
		mid = left + (right - left) / 2;
		if(f(mid) > 0) right = mid; 	// mid > √2
		else left = mid;
	} 
	return mid;
}

快速幂

typedef long long LL;
// a^b % m 递归法 
LL binaryPow(LL a, LL b, LL m) {
	if(b == 0) return 1;					// a^0 = 1
	else if (b & 1) return a * binaryPow(a, b-1, m) % m;	// b 奇数 a^b = a * a^(b-1) 
	else {									// b 偶数 a^b = a^b/2 * a^b/2 
		LL temp = binaryPow(a, b/2, m);
		return temp * temp % m
	}
} 
// a^b % m 迭代法  
LL pow(LL a, LL b, LL m) {
	LL ans = 1;
	while(b > 0) {
		if(b & 1) {
			ans = ans * a % m;
		}
		a = a * a % m;
		b >>= 1;
	}
	return ans;
}