0/1分数规划
QAQQQQQQQQQQQ
菜
展开
-
0/1分数规划--poj2976
裸的0/1分数规划 二分答案v,算出a[i]-b[i]*v 取最大的k个加起来的和大于eps则可行上代码:#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define maxn 1005u...原创 2018-05-26 22:48:10 · 121 阅读 · 0 评论 -
0/1分数规划-最优比率环--poj3621
Sightseeing Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11190 Accepted: 3800 DescriptionFarmer John has decided to reward his cows for their hard work by taking th...原创 2018-05-28 23:59:22 · 134 阅读 · 0 评论