zjut1698Coins
摘要:
/*多重背包zjut 1698 Coins 思路:根据每个coin的x y值大致得出每种coin最多可取几个,然后用二进制处理产生新的coin,将问题转化为01背包状态转移:dp[j][k]=min(dp[j-xx[i]][k-yy[i]]+cost[i],dp[j][k]);*/#include<iostream>#include<cmath>#include<algorithm>using namespace std;int m,s;int x[101],y[101],dp[301][301],vis[301][301];int xx[100001],y 阅读全文