Loading...
一、背包问题1.1、0-1背包问题1.1.1朴素版做法void beibao1(){ const int N = 1e3 + 5; int n,m; int v[N],w[N]; int f[N][N] = {{0}}; cin >> n >> m; for(int i = 1;i <= n;i++) cin &g...
#include <iostream> #include <algorithm> #include <unordered_map> #include <vector> #include <queue> using namespace std; struct TreeNode {//定义结构体 int val; ...