dp-实现0-1背包

#include <iostream>#include <stdio.h>  #include <algorithm> using namespace std; const int maxn=100; int main(int argc, char** argv) { int n,V; scanf("%d%d",&n,&V); int w[maxn],c[maxn]; for(int i=1;i<

>>阅读原文<<