hdu 1963 Investment 解题报告

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 using namespace std;
 5 
 6 const int maxn = 1e6 + 5;
 7 
 8 typedef long long ll;
 9 int value[maxn], interest[maxn];
10 ll dp[maxn], ans, money, tolmoney;
11 
12 int main()
13 {
14     int kind, tcase, year;
15     while (scanf("%d", &tcase) != EOF)
16     {
17         while (tcase--)
18         {
19             scanf("%lld%d", &money, &year);
20             scanf("%d", &kind);
21             for (int i = 0; i < kind; i++)
22             {
23                 scanf("%d%d", &value[i], &interest[i]);
24                 value[i] /= 1000;
25             }
26             memset(dp, 0, sizeof(dp));
27             ans = 0, tolmoney = money;
28             for (int j = 0; j < year; j++)
29             {
30                 if (j != 0)
31                     money = tolmoney;
32                 money /= 1000;
33                 for (int i = 0; i < kind; i++)
34                 {
35                     for (int k = value[i]; k <= money; k++)
36                     {
37                         dp[k] = max(dp[k], dp[k-value[i]] + interest[i]);
38                         ans = max(dp[k], ans);
39                     }
40                 }
41                 tolmoney += ans;
42             }
43             printf("%lld\n", tolmoney);
44         }
45     }
46     return 0;
47 }