算法概论 动态规划 0-1背包问题
#include <iostream>#include <string>using namespace std;const int N = 8 + 1;const int O = 4 + 1;const int V[O] = {0, 2, 3, 4, 5};const int P[O] = {0, 3, 4, 5, 6};int main(){ int M[O][N] = {}; for (int i = 0; i < O; i++)
原创
2021-11-16 21:21:14 ·
101 阅读 ·
0 评论