[luoguP1507] NASA的食物计划（DP）

传送门

二位费用背包

——代码

 #include <cstdio>
 #include <iostream>

 int n, maxv, maxw;
 int f[][];

 inline int read()
 {
     int x = , f = ;
     char ch = getchar();
     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;
     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';
     return x * f;
 }

 inline int max(int x, int y)
 {
     return x > y ? x : y;
 }

 int main()
 {
     int i, j, k, v, w, val;
     maxv = read();
     maxw = read();
     n = read();
     for(i = ; i <= n; i++)
     {
         v = read();
         w = read();
         val = read();
         for(j = maxv; j >= v; j--)
             for(k = maxw; k >= w; k--)
                 f[j][k] = max(f[j][k], f[j - v][k - w] + val);
     }
     printf("%d\n", f[maxv][maxw]);
     return ;
 }