[贪心] cf1400 B. RPG Protagonist

题目

题目链接：http://codeforces.com/contest/1400/problem/B

思路

枚举$s、w$中小的数即可

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;

int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		int p,f,nums,numw,s,w;
		cin>>p>>f>>nums>>numw>>s>>w;
		if(s>w) swap(s,w),swap(nums,numw);
		int a,b,c,d,e,ans=0,mmax=min(nums,p/s);
		for(int i=0;i<=mmax;i++){
			if(p>=i*s){
				a=p-i*s;
				e=i;
			}
			b=a/w;
			b=min(b,numw);
			c=f/s;
			c=min(c,nums-i);
			d=(f-c*s)/w;
			d=min(d,numw-b);
		//	cout<<e<<" "<<b<<" "<<c<<" "<<d<<endl;
			ans=max(ans,e+b+c+d);
		}
		cout<<ans<<endl; 
	} 
    return 0;
}