随笔分类 -  【ACM之路之二分搜索】

摘要:int main(){ == key int m; while ( l > 1; if ( x[m] == key ) return m; else if ( key > x[m] ) l = m... 阅读全文
posted @ 2018-03-13 14:56 Bryce1010 阅读(112) 评论(0) 推荐(0)
摘要:1010 只包含因子2 3 5的数基准时间限制:1 秒 空间限制:131072 KB 分值: 10 难度:2级算法题 收藏 关注K的因子中只包含2 3 5。满足条件的前10个数是:2,3,4,5,6,8,9,10,12,15。所有这样的K组成了一个序列S,现在给出一个... 阅读全文
posted @ 2017-11-15 21:07 Bryce1010 阅读(107) 评论(0) 推荐(0)
摘要:4 Values whose Sum is 0Time Limit: 15000MS Memory Limit: 228000KTotal Submissions: 23757 Accepted: 7192Case Time Limit: 5000MSDescript... 阅读全文
posted @ 2017-08-17 20:04 Bryce1010 阅读(104) 评论(0) 推荐(0)
摘要:4 Values whose Sum is 0Time Limit: 15000MS Memory Limit: 228000KTotal Submissions: 23757 Accepted: 7192Case Time Limit: 5000MSDescript... 阅读全文
posted @ 2017-08-17 20:04 Bryce1010 阅读(89) 评论(0) 推荐(0)
摘要:题目:有n个重量和价值分别为w(i)和v(i)的物品,从中选出k个物品是的单位重量的价值最大。输入:n=3 k=2 (w,v)={(2,2),(5,3),(2,1)} 输出:0.75(选择0和2) 一般都会想直接按单位重量的价值排序,然后进行贪心,但是发现这种方法样... 阅读全文
posted @ 2017-08-13 21:29 Bryce1010 阅读(89) 评论(0) 推荐(0)
摘要:题目:有n个重量和价值分别为w(i)和v(i)的物品,从中选出k个物品是的单位重量的价值最大。输入:n=3 k=2 (w,v)={(2,2),(5,3),(2,1)} 输出:0.75(选择0和2) 一般都会想直接按单位重量的价值排序,然后进行贪心,但是发现这种方法样... 阅读全文
posted @ 2017-08-13 21:29 Bryce1010 阅读(74) 评论(0) 推荐(0)
摘要:Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15528 Accepted: 7440DescriptionFarmer John has built a new lo... 阅读全文
posted @ 2017-08-13 20:52 Bryce1010 阅读(83) 评论(0) 推荐(0)
摘要:Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15528 Accepted: 7440DescriptionFarmer John has built a new lo... 阅读全文
posted @ 2017-08-13 20:52 Bryce1010 阅读(86) 评论(0) 推荐(0)
摘要:Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49944 Accepted: 10493DescriptionInhabitants of the Wonderland ha... 阅读全文
posted @ 2017-08-13 20:25 Bryce1010 阅读(75) 评论(0) 推荐(0)
摘要:Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49944 Accepted: 10493DescriptionInhabitants of the Wonderland ha... 阅读全文
posted @ 2017-08-13 20:25 Bryce1010 阅读(91) 评论(0) 推荐(0)