【HDOJ】3496 Watch The Movie

二维费用背包。

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

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

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

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

     return ;
 }