Brute 暴力

Brute 暴力

枚举子集

int x; cin >> x;
for(int i = x;i;i = (i - 1) & x) cout << i << '\n';

二分

二分答案

01分数规划

$$给出n个物品，每个物品有两个属性a和b，选择k个元素，询问\sum a_i/\sum b_i的最大值$$

$$\sum a_i/\sum b_i\ge x=\sum a_i-x\sum b_i\ge 0$$

• 对x二分答案即可求得最大值
• f(x)为a[i] - x * b[i]的值

double l = 0, r = 1e10;

function<bool(double)> cek = [&](double x) {
    vector<double> tmp(n + 1, 0);
	for(int i = 1;i <= n;i++) tmp[i] = a[i] - x * b[i];
	sort(tmp.begin() + 1, tmp.end(), [](double x, double y) {
		return x > y;
	});
	double ret = 0;
	for(int i = 1;i <= k;i++) ret += tmp[i];
	return ret >= 0;
};

while(fabs(l - r) > eps) {
	double mid = (l + r) / 2.0;
	if(cek(mid)) l = mid;
	else r = mid;
}