思路如下:只要求出所有可行的支票,能凑出的最多的报销额度,并且不大于最大额度;(坑点就是支票上单项不超600,不是每个都不超过600,难点是动态转移方程dp[j]=max(dp[j],dp[j-val[i]]+val[i]));
ac代码如下:
#include <bits/stdc++.h>
using namespace std;
int dp[5000010];
int val[40];
int main()
{
double q,y;
int n;
while (cin >> q >> n && n)
{
memset(dp, 0, sizeof(dp));
int x = 1;//代表发票可以用的数量
for (int i = 0; i < n; i++)
{
int k; scanf("%d", &k);
int a = 0, b = 0, c = 0;
int flag = 1;
while (k--)
{
char s; scanf(" %c:%lf", &s, &y);
int w = (int)(y * 100);
if (s == 'A'&&a + w <= 60000) a += w;
else
if (s == 'B'&&b + w <= 60000) b += w;
else if (s == 'C'&& c + w <= 60000) c += w;
else flag = 0;
}
if (a + b + c <= 100000 && a <= 60000 && b <= 60000 && c <= 60000 && flag)
val[x++] = a + b + c;
}
int w = (int)(q * 100);
for (int i = 1; i < x; i++)
{
for (int j = w; j >= val[i]; j--)
{
if (j > val[i])
dp[j] = max(dp[j - val[i]] + val[i], dp[j]);
else if (j == val[i])
dp[j] = val[i];
}
}
int qian, hou;
qian = dp[w] / 100;
hou = dp[w] % 100;
printf("%d.%02d\n", qian, hou);
}
return 0;
}