其实挺水的,贪心策略:选择性价比最高的先选,剩下的n%lcm+lcm的就枚举a,b的数量,注意从size大的开始枚举,不然超时。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
typedef long long ll;
ll n,c1,w1,c2,w2;
ll gcd(ll a,ll b)
{
return a%b==0?b:gcd(b,a%b);
}
int main()
{
int cas,ca=1;
cin>>cas;
while(cas--)
{
cin>>n>>c1>>w1>>c2>>w2;
if(1.0*w1/c1<1.0*w2/c2) swap(c1,c2),swap(w1,w2);
ll lcm=c1/gcd(c1,c2)*c2;
ll last=n%lcm;
ll times=n/lcm;
if(times) {last+=lcm;times--;}
ll ans=lcm/c1*w1*times;
if(c1<c2) swap(c1,c2),swap(w1,w2);
ll top=last/c1;
ll maxn=0;
for(ll i=0;i<=top;i++)
{
ll tmp=w1*i+(last-c1*i)/c2*w2;
maxn=max(maxn,tmp);
}
printf("Case #%d: ",ca++);
cout<<ans+maxn<<endl;
}
return 0;
}