随笔分类 -  分治—01分数规划

摘要:传送门 题目大意:n个二元组a[i],b[i],去掉k个,求sigma a[i]/ sigma b[i]的最大值 代码: 阅读全文
posted @ 2019-12-04 23:41 ANhour 阅读(149) 评论(0) 推荐(0)
摘要:Sightseeing Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10595 Accepted: 3632 Description Farmer John has decided to reward his cow 阅读全文
posted @ 2017-10-09 11:38 ANhour 阅读(194) 评论(0) 推荐(0)
摘要:Desert King Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 27012 Accepted: 7501 Description David the Great has just become the king of a 阅读全文
posted @ 2017-10-09 10:56 ANhour 阅读(179) 评论(0) 推荐(0)
摘要:Dropping tests Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13793 Accepted: 4838 Description In a certain course, you take n tests. If y 阅读全文
posted @ 2017-10-09 09:49 ANhour 阅读(148) 评论(0) 推荐(0)