2019/6/2菜鸟刷题日常= =

菜鸟刷题日常！（二分）
题目链接:https://codeforc.es/problemset/problem/371/C
C. Hamburgers
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his favorite “Le Hamburger de Polycarpus” as a string of letters ‘B’ (bread), ‘S’ (sausage) и ‘C’ (cheese). The ingredients in the recipe go from bottom to top, for example, recipe “ВSCBS” represents the hamburger where the ingredients go from bottom to top as bread, sausage, cheese, bread and sausage again.

Polycarpus has nb pieces of bread, ns pieces of sausage and nc pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are pb rubles for a piece of bread, ps for a piece of sausage and pc for a piece of cheese.

Polycarpus has r rubles and he is ready to shop on them. What maximum number of hamburgers can he cook? You can assume that Polycarpus cannot break or slice any of the pieces of bread, sausage or cheese. Besides, the shop has an unlimited number of pieces of each ingredient.

Input
The first line of the input contains a non-empty string that describes the recipe of “Le Hamburger de Polycarpus”. The length of the string doesn’t exceed 100, the string contains only letters ‘B’ (uppercase English B), ‘S’ (uppercase English S) and ‘C’ (uppercase English C).

The second line contains three integers nb, ns, nc (1 ≤ nb, ns, nc ≤ 100) — the number of the pieces of bread, sausage and cheese on Polycarpus’ kitchen. The third line contains three integers pb, ps, pc (1 ≤ pb, ps, pc ≤ 100) — the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1 ≤ r ≤ 1012) — the number of rubles Polycarpus has.

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

Output
Print the maximum number of hamburgers Polycarpus can make. If he can’t make any hamburger, print 0.
题解:
问题求解分为两个部分，在r内求最大的可制作汉堡数，和每种材料的需求量；
设定可制作x个汉堡
材料的需求量=max（0，px - n）;
总耗费价s(x)=max(0,pbx-nb)pb+max(0,psx-ns)ps+max(0,pcx-nc)*pc<=r;

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const ll INF=1e13;
string str;
ll b,s,c;
ll nb,ns,nc;
ll pb,ps,pc;
ll r;
bool check(ll x){
    ll n_b=max(0ll,x*b-nb);
    ll n_s=max(0ll,x*s-ns);
    ll n_c=max(0ll,x*c-nc);
    ll money=pb*n_b+ps*n_s+pc*n_c;
    if(r>=money)return true;
    return false;
}
int main(){
    cin>>str;
    cin>>nb>>ns>>nc;
    cin>>pb>>ps>>pc;
    cin>>r;
    for(int i=0;i<str.length();i++){
        if(str[i]=='B')b++;
        else if(str[i]=='S')s++;
        else if(str[i]=='C')c++;
    }
    ll ans=0;
    ll l=0,r=INF;
    while(l<=r){
        ll mid=(r+l)>>1;
        if(check(mid)){
            ans=mid;
            l=mid+1;
        }
        else r=mid-1;
    }
    cout<<ans;
    return 0;
}