本文共 2280 字，大约阅读时间需要 7 分钟。

???????????????N??????????????????????????????????????????????????????????????????????????

??????????????????????????T??????????????N?M?????N??????????T1?T2?T3?F1?F2????

• T1??????????
• T2??????????
• T3??????????
• F1???????????????/??
• F2???????????????/??

???????????????????????????

????????????DP???????????????????dp???dp[i][j]?????i????????j???????????

?????

?????

#include 
   
    using namespace std;typedef long long ll;const int maxn = 2001;const int inf = 0x3f3f3f3f;int main() {    int T, n, m;    scanf("%d", &T);    while (T--) {        scanf("%d %d", &n, &m);        vector
    
      t1(n + 1), t2(n + 1), t3(n + 1);        vector
     
       f1(n + 1), f2(n + 1);        for (int i = 1; i <= n; ++i) {            int T1, T2, T3, F1, F2;            scanf("%d %d %d %d %d", &T1, &T2, &T3, &F1, &F2);            t1[i] = T1;            t2[i] = T2;            t3[i] = T3;            f1[i] = F1;            f2[i] = F2;        }        vector
      
        dp(m + 1, inf);        dp[0] = 0;        for (int i = 1; i <= n; ++i) {            vector
       
         new_dp(m + 1, inf);            for (int j = 0; j <= m; ++j) {                if (j >= f1[i]) {                    if (new_dp[j - f1[i]] > dp[j] + t1[i]) {                        new_dp[j - f1[i]] = dp[j] + t1[i];                    }                }                if (new_dp[j] > dp[j] + t2[i]) {                    new_dp[j] = dp[j] + t2[i];                }                int next_j = min(j + f2[i], m);                if (new_dp[next_j] > dp[j] + t3[i]) {                    new_dp[next_j] = dp[j] + t3[i];                }            }            dp = new_dp;        }        int ans = inf;        for (int j = 0; j <= m; ++j) {            if (dp[j] < ans) {                ans = dp[j];            }        }        printf("%d\n", ans);    }}
       
      
     
    
   

?????

????????????????????????????????

转载地址：http://hhewz.baihongyu.com/