hero_th的博客

VLPWJVVNNZSWFGHSFRBCOIJTPYNEURPIGKQGPSXUGNELGRVZAGSDLLOVGRTWEYZKKXNKIRWGZWXWRHKXFASATDWZAPZRNHTNNGQFZGUGXVQDQAEAHOQEADMWWXFBXECKAVIGPTKTTQFWSWPKRPSMGABDGMGYHAOPPRRHKYZCMFZEDELCALTBSWNTAODXYVHQNDASUFRLYVYWQZUTEPFSFXLTZBMBQETXGXFUEBHGMJKBPNIHMYOELYZIKH..

Problem DescriptionAC Code#include <iostream>#include <queue>#include <cmath>#include <algorithm>#include <unordered_set>#include <string>#include <cstring>#include <vector>using namespace std;in

Problem DescriptionAC Code#include <iostream>#include <queue>#include <cmath>#include <algorithm>#include <unordered_set>#include <string>#include <cstring>#include <vector>using namespace std;in

Problem Description01背包问题problem description: 有n件物品，每件物品的重量为w[i]，价值为c[i]。现有一个容量为V的背包，问如何选取物品放入背包，使得背包内物品的总价值最大。其中每种物品都只有一件。二维数组dp:优化空间，一维数组dp：AC Code#include <iostream>#include <queue>#include <cmath>#include <algorithm&

Problem DescriptionAC Code#include <iostream>#include <queue>#include <cmath>#include <algorithm>#include <unordered_set>#include <string>#include <cstring>using namespace std;int main(){ for (int