摘要: 有依赖背包 #include<iostream> #include<algorithm> #include<cstring> using namespace std; const int maxn=55; const int maxv=100005; int tmp[maxv]; int f[max 阅读全文
posted @ 2019-07-22 21:18 fanhao110 阅读(182) 评论(0) 推荐(0)