题意:
给出一个容量是n的背包,n<(2^32),给出蓝宝石和绿宝石的体积和价值,每种宝石都是无限多的,求能得到的最大价值。
思路:
暴力,确定了一种宝石拿的数量,就能确定另一种宝石能拿的最大数量。
代码:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int maxcal = 1000000;
int main()
{
int t;
scanf("%d", &t);
int kase = 1;
while (t--) {
long long n, s1, v1, s2, v2;
scanf("%lld%lld%lld%lld%lld", &n, &s1, &v1, &s2, &v2);
long long ans = 0;
if (n / s1 < maxcal) {
int num = n / s1;
for (int i = 0; i <= num; i++) {
int n2 = (n - i * s1) / s2;
long long temp = i * v1 + n2 * v2;
if (temp > ans) {
ans = temp;
}
}
}
else if (n / s2 < maxcal) {
int num = n / s2;
for (int i = 0; i <= num; i++) {
int n1 = (n - i * s2) / s1;
long long temp = i * v2 + n1 * v1;
if (temp > ans)
ans = temp;
}
}
else {
if (s2 * v1 > s1 * v2) {
for (int i = 0; i < s1; i++) {
int n1 = (n - i * s2) / s1;
long long temp = n1 * v1 + i * v2;
if (temp > ans)
ans = temp;
}
}
else {
for (int i = 0; i < s2; i++) {
int n2 = (n - i * s1) / s2;
long long temp = i * v1 + n2 * v2;
if (temp > ans)
ans = temp;
}
}
}
printf("Case #%d: %lld\n",kase++, ans);
}
return 0;
}