【HDOJ】1963 Investment

完全背包。

#include <stdio.h>
#include <string.h>

#define max(a, b) (a>b) ? a:b

int val[15], an[15];
int dp[50000];

int main() {
    int case_n;
    int n, m, year;
    int i, j, k;

    scanf("%d", &case_n);

    while (case_n--) {
        scanf("%d %d", &m, &year);
        scanf("%d", &n);
        for (i=1; i<=n; ++i) {
            scanf("%d %d", &val[i], &an[i]);
            val[i] /= 1000;
        }
        for (k=1; k<=year; ++k) {
            memset(dp, 0, sizeof(dp));
            for (i=1; i<=n; ++i) {
                for (j=val[i]; j<=m/1000; ++j)
                    dp[j] = max(dp[j], dp[j-val[i]]+an[i]);
            }
            //printf("%dyear:%d
", k, dp[m/1000]);
            m += dp[m/1000];
        }
        printf("%d
", m);
    }

    return 0;
}