'commit'

C++专题课程/动态规划/动态规划-1-01背包.cpp

@@ -0,0 +1,32 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+/*
+֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD><EFBFBD><EFBFBD>̬<EFBFBD><EFBFBD><EFBFBD><EFBFBD>0-1<><31><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
+
+<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
+https://www.cnblogs.com/aiguona/p/7274222.html
+*/
+
+using namespace std;
+int w[105], val[105];
+int dp[105][1005];
+
+int main() {
+    int t, m;
+    cin >> t >> m;
+    for (int i = 1; i <= m; i++)
+        cin >> w[i] >> val[i];
+
+    for (int i = 1; i <= m; i++) //<2F><>Ʒ
+        for (int j = t; j >= 0; j--) //<2F><><EFBFBD><EFBFBD>
+        {
+            if (j >= w[i])
+                dp[i][j] = max(dp[i - 1][j - w[i]] + val[i], dp[i - 1][j]);
+            else
+                dp[i][j] = dp[i - 1][j];
+        }
+    cout << dp[m][t] << endl;
+    return 0;
+}