【HDOJ】3496 Watch The Movie

二维费用背包。

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

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

int dp[105][1005];
int time[105], val[105];

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

    scanf("%d", &case_n);

    while (case_n--) {
        scanf("%d%d%d", &n, &m, &l);
        for (i=1; i<=n; ++i)
            scanf("%d %d", &time[i], &val[i]);
        memset(dp, 0xff, sizeof(dp));
        dp[0][0] = 0;
        for (i=1; i<=n; ++i) {
            for (k=m; k>0; --k) {
                for (j=l; j>=time[i]; --j) {
                    if (dp[k-1][j-time[i]] != -1) {
                        dp[k][j] = mymax(dp[k][j], dp[k-1][j-time[i]]+val[i]); 
                    }
                }
            }
        }
        k = 0;
        for (i=0; i<=l; ++i) {
            if (dp[m][i] > k)
                k = dp[m][i];
        }
        printf("%d
", k);
    }

    return 0;
}