'commit'

TangDou/AcWing/BeiBao/MaxMin/QiaHao_01_Max.in

@@ -0,0 +1,5 @@
+4 5
+1 2
+2 4
+3 4
+4 5

TangDou/AcWing/BeiBao/MaxMin/QiaHao_01_Max_ErWei.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N][N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_01_Max.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+    memset(f, -INF, sizeof f);
+    f[0][0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (j >= v) f[i][j] = max(f[i][j], f[i - 1][j - v] + w);
+        }
+    }
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/QiaHao_01_Max_YiWei.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_01_Max.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+
+    memset(f, -INF, sizeof f);
+    f[0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = m; j >= v; j--)
+            f[j] = max(f[j], f[j - v] + w);
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/QiaHao_01_Min.in

@@ -0,0 +1,5 @@
+4 5
+1 2
+2 4
+3 4
+4 5

TangDou/AcWing/BeiBao/MaxMin/QiaHao_01_Min_ErWei.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N][N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_01_Min.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+    memset(f, 0x3f, sizeof f); //预求最小，先设最大
+    f[0][0] = 0;              //前0个物品中选择，装满0个空间，获得的最小值为0
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (j >= v) f[i][j] = min(f[i][j], f[i - 1][j - v] + w);
+        }
+    }
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/QiaHao_01_Min_YiWei.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_01_Min.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+    memset(f, 0x3f, sizeof f);
+    f[0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = m; j >= v; j--)
+            f[j] = min(f[j], f[j - v] + w);
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/QiaHao_WQ_Max.in

@@ -0,0 +1,5 @@
+4 5
+1 2
+2 4
+3 4
+4 5

TangDou/AcWing/BeiBao/MaxMin/QiaHao_WQ_Max_ErWei.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N][N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_WQ_Max.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+
+    memset(f, -INF, sizeof f);
+    f[0][0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (j >= v) f[i][j] = max(f[i][j], f[i][j - v] + w);
+        }
+    }
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/QiaHao_WQ_Max_YiWei.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_WQ_Max.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+
+    memset(f, -INF, sizeof f);
+    f[0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = v; j <= m; j++)
+            f[j] = max(f[j], f[j - v] + w);
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/QiaHao_WQ_Min.in

@@ -0,0 +1,5 @@
+4 5
+1 2
+2 4
+3 4
+4 5

TangDou/AcWing/BeiBao/MaxMin/QiaHao_WQ_Min_ErWei.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N][N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_WQ_Min.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+
+    memset(f, 0x3f, sizeof f);
+    f[0][0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (j >= v) f[i][j] = min(f[i][j], f[i][j - v] + w);
+        }
+    }
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/QiaHao_WQ_Min_YiWei.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110, INF = 0x3f3f3f3f;
+
+int n, m;
+int f[N];
+
+int main() {
+    //文件输入
+    freopen("QiaHao_WQ_Min.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+
+    memset(f, 0x3f, sizeof f);
+    f[0] = 0;
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = v; j <= m; j++)
+            f[j] = min(f[j], f[j - v] + w);
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiDuo_01.in

@@ -0,0 +1,5 @@
+4 5
+1 2
+2 4
+3 4
+4 5

TangDou/AcWing/BeiBao/MaxMin/ZhiDuo_01_Max_ErWei.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+int n, m;
+int f[N][N];
+
+int main() {
+    //文件输入
+    freopen("ZhiDuo_01.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (j >= v) f[i][j] = max(f[i][j], f[i - 1][j - v] + w);
+        }
+  }
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiDuo_01_Max_YiWei.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+int n, m;
+int f[N];
+
+int main() {
+    scanf("%d %d", &n, &m);
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = m; j >= v; j--)
+            f[j] = max(f[j], f[j - v] + w);
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiDuo_WQ.in

@@ -0,0 +1,5 @@
+4 5
+1 2
+2 4
+3 4
+4 5

TangDou/AcWing/BeiBao/MaxMin/ZhiDuo_WQ_Max_ErWei.cpp

@@ -0,0 +1,24 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+const int N = 1010;
+int n, m;
+int f[N][N];
+
+int main() {
+    //文件输入
+    freopen("ZhiDuo_WQ.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 1; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (j >= v) f[i][j] = max(f[i][j], f[i][j - v] + w);
+        }
+    }
+
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiDuo_WQ_Max_YiWei.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 1010;
+int n, m;
+int f[N];
+
+// 完全背包问题
+int main() {
+    //文件输入
+    freopen("ZhiDuo_WQ.in", "r", stdin);
+    scanf("%d %d", &n, &m);
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = v; j <= m; j++) //一个一个加上来，求一个最大值
+            f[j] = max(f[j], f[j - v] + w);
+  }
+    printf("%d\n", f[m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiShao_01_Min.in

@@ -0,0 +1,5 @@
+4 5
+1 2
+2 4
+3 4
+4 5

TangDou/AcWing/BeiBao/MaxMin/ZhiShao_01_Min_ErWei.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+/*
+个数　 空间至少5　
+体积 　价值
+
+求：   最小价值
+
+3     5
+1     2
+4     9
+3     6
+
+答案应该是：11。 即 1,4-->2+9=11
+*/
+int n, m;
+int f[N][N];
+
+int main() {
+    scanf("%d %d", &n, &m);
+
+    memset(f, 0x3f, sizeof f);
+    f[0][0] = 0;
+
+    // 01背包！！！
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++)
+            f[i][j] = min(f[i - 1][j], f[i - 1][max(0, j - v)] + w);
+    }
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiShao_01_Min_YiWei.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+/*
+个数　 空间至少5　
+体积 　价值
+
+求：   最小价值
+
+3     5
+1     2
+4     9
+3     6
+
+答案应该是：11。 即 1,4-->2+9=11
+*/
+int n, m;
+int f[N];
+
+int main() {
+    scanf("%d %d", &n, &m);
+
+    memset(f, 0x3f, sizeof f);
+    f[0] = 0;
+
+    // 01背包！！！
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = m; j >= v; j--)
+            f[j] = min(f[j], f[max(0, j - v)] + w);
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiShao_WQ_Min_ErWei.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+/*
+个数　 空间至少5　
+体积 　价值
+
+求：   最小价值
+
+1     5
+1     1
+
+
+---
+
+再来一组数据
+
+个数　 空间至少5　
+体积 　价值
+
+求：   最小价值
+
+3     5
+1     2
+4     9
+3     6
+
+答案：10
+*/
+int n, m;
+int f[N][N];
+
+int main() {
+    scanf("%d %d", &n, &m);
+
+    memset(f, 0x3f, sizeof f);
+    f[0][0] = 0;
+
+    //这么写是可以选择多个的，也就是完全背包！！！
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++)
+            f[i][j] = min(f[i - 1][j], f[i][max(0, j - v)] + w); //即使物品体积比j大，j - v < 0，也能选，等价于f[i - 1][0]
+    }
+    printf("%d\n", f[n][m]);
+    return 0;
+}

TangDou/AcWing/BeiBao/MaxMin/ZhiShao_WQ_Min_YiWei.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int N = 110;
+const int INF = 0x3f3f3f3f;
+/*
+个数　 空间至少5　
+体积 　价值
+
+求：   最小价值
+
+1     5
+1     1
+
+
+---
+
+再来一组数据
+
+个数　 空间至少5　
+体积 　价值
+
+求：   最小价值
+
+3     5
+1     2
+4     9
+3     6
+
+答案：10
+*/
+int n, m;
+int f[N];
+
+int main() {
+    scanf("%d %d", &n, &m);
+
+    memset(f, 0x3f, sizeof f);
+    f[0] = 0;
+
+    //这么写是可以选择多个的，也就是完全背包！！！
+    for (int i = 1; i <= n; i++) {
+        int v, w;
+        scanf("%d %d", &v, &w);
+        for (int j = 0; j <= m; j++)
+            f[j] = min(f[j], f[max(0, j - v)] + w);
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}