1.题目描述:点击打开链接
2.解题思路:本题是一道动态规划题,不过可以直接进行暴力搜索,和上次CF的ZeptoLab的C题完全一样,不再赘述。
3.代码:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<functional>
using namespace std;
typedef long long ll;
const int N = 100000;
int main()
{
//freopen("t.txt", "r", stdin);
int T;
int rnd = 0;
int n, s1, v1, s2, v2;
cin >> T;
while (T--)
{
cin >> n >> s1 >> v1 >> s2 >> v2;
int maxn = n / s1;
ll ans = 0;
for (ll i = 0; i < N; i++)
{
if (i*s1 <= n)
ans = max(ans, i*v1 + (n - i*s1) / s2*v2);
if (i*s2 <= n)
ans = max(ans, i*v2 + (n - i*s2) / s1*v1);
}
printf("Case #%d: ", ++rnd);
cout << ans << endl;
}
return 0;
}