https://blog.youkuaiyun.com/losteracmerzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/losteracmer/article/details/99637867https://blog.youkuaiyun.com/losteracmer/article/details/99637867losteracmerThu, 15 Aug 2019 15:31:16 +0800https://blog.youkuaiyun.com/losteracmer/article/details/81394728https://blog.youkuaiyun.com/losteracmer/article/details/81394728losteracmerFri, 03 Aug 2018 22:14:16 +0800https://blog.youkuaiyun.com/losteracmer/article/details/81268169https://blog.youkuaiyun.com/losteracmer/article/details/81268169losteracmerSun, 29 Jul 2018 09:55:35 +0800https://blog.youkuaiyun.com/losteracmer/article/details/79216326https://blog.youkuaiyun.com/losteracmer/article/details/79216326losteracmerWed, 31 Jan 2018 13:50:27 +0800https://blog.youkuaiyun.com/losteracmer/article/details/79216133https://blog.youkuaiyun.com/losteracmer/article/details/79216133losteracmerWed, 31 Jan 2018 13:32:18 +0800主题 this is code！ #include using namespace std; const int N = 10000; int dp[N]; int c[N],w[N],num[N];//分别是价值，重量，数量 int n,m; void ZeroOne_Pack(int cost,int weight,int m)//01背包 { for(int i=m;]]>https://blog.youkuaiyun.com/losteracmer/article/details/78907448https://blog.youkuaiyun.com/losteracmer/article/details/78907448losteracmerTue, 26 Dec 2017 22:48:48 +0800https://blog.youkuaiyun.com/losteracmer/article/details/78885628https://blog.youkuaiyun.com/losteracmer/article/details/78885628losteracmerSun, 24 Dec 2017 16:24:04 +0800https://blog.youkuaiyun.com/losteracmer/article/details/78736424https://blog.youkuaiyun.com/losteracmer/article/details/78736424losteracmerWed, 06 Dec 2017 23:11:27 +0800https://blog.youkuaiyun.com/losteracmer/article/details/78678881https://blog.youkuaiyun.com/losteracmer/article/details/78678881losteracmerThu, 30 Nov 2017 17:44:44 +0800 #include #include #includehttps://blog.youkuaiyun.com/losteracmer/article/details/78422823https://blog.youkuaiyun.com/losteracmer/article/details/78422823losteracmerThu, 02 Nov 2017 11:15:26 +0800 #include #includeusing namespace std; const int maxn=110; char tab[maxn]; int f[]]>https://blog.youkuaiyun.com/losteracmer/article/details/77844570https://blog.youkuaiyun.com/losteracmer/article/details/77844570losteracmerMon, 04 Sep 2017 22:55:54 +0800https://blog.youkuaiyun.com/losteracmer/article/details/77185791https://blog.youkuaiyun.com/losteracmer/article/details/77185791losteracmerTue, 15 Aug 2017 11:25:46 +0800https://blog.youkuaiyun.com/losteracmer/article/details/57405955https://blog.youkuaiyun.com/losteracmer/article/details/57405955losteracmerSun, 26 Feb 2017 11:26:16 +0800