Codeforces 371C Hamurgers 二分答案

题意：给一种汉堡配方（Bread、Sausage、Cheese），给出店里有的配料，可以去商店买任意配料，给出商店每种配料价格，还有拥有的钱数，求可以做的最多汉堡数
思路：用二分法，检验当前钱数是否足够支撑做出当前汉堡数，求出不满足答案的第一个数，即可求出满足答案的最后一个数即最多汉堡数

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn = 30;
string s;
ll n[3], p[3], r, need[3];
bool check(ll k)
{
	ll t = 0, money = r, q[3];
	for (int i = 0; i < 3; i++) {
		if (need[i]*k > n[i]) {
			ll temp = need[i]*k - n[i];
			money -= temp * p[i];
		}
	}
	if (money < 0) 
		return false;
	return true;
}
int main()
{
	while (cin >> s) {
		for (int i = 0; i < 3; i++) {
			cin >> n[i];
			need[i] = 0;
		}
		for (int i = 0; i < 3; i++)
			cin >> p[i];
		cin >> r;
		for (int i = 0; i < s.length(); i++) {
			if (s[i] == 'B')
				need[0]++;
			if (s[i] == 'S')
				need[1]++;
			if (s[i] == 'C')
				need[2]++;
		}
		ll L = 0, R = 2e12;
		while (L+1 < R) {
			ll mid = (L+R) / 2;
			if (check(mid)) L = mid;
			else R = mid;
		}
		cout << L << endl;
	}
}