超大背包问题

  #include<stdio.h> #include<algorithm> #include<iostream> typedef unsigned long long LL; using namespace std; const int maxn = 40; LL INF = (1<<32)-1; //const LL INF = 0xFFFFFF; int n; LL w[maxn],v[

>>阅读原文<<