2015 年 7月 30 日随笔档案 - handsomecui

2015年7月30日

摘要： Yougth的最大化时间限制：1000 ms | 内存限制：65535 KB 难度：4描述Yougth现在有n个物品的重量和价值分别是Wi和Vi，你能帮他从中选出k个物品使得单位重量的价值最大吗？输入有多组测试数据每组测试数据第一行有两个数n和k，接下来一行有n个数Wi和Vi。(1 2 #inclu... 阅读全文

posted @ 2015-07-30 21:33 handsomecui 阅读(672) 评论(0) 推荐(0)

Cable master（好题，二分）

摘要： Cable masterTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2473Accepted Submission(s): 922Problem... 阅读全文

posted @ 2015-07-30 16:19 handsomecui 阅读(604) 评论(0) 推荐(0)

Can you find it?(二分二分+STL set map)

摘要： Can you find it? Problem Description Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can fi 阅读全文

posted @ 2015-07-30 13:45 handsomecui 阅读(233) 评论(0) 推荐(0)

Can you solve this equation?（二分）

摘要： Can you solve this equation?Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 61Accepted Submission(s... 阅读全文

posted @ 2015-07-30 12:36 handsomecui 阅读(527) 评论(0) 推荐(0)

Bridging signals（二分二分+stl dp）

摘要：欢迎参加——每周六晚的BestCoder（有米！）Bridging signalsTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 941Accept... 阅读全文

posted @ 2015-07-30 11:35 handsomecui 阅读(315) 评论(0) 推荐(0)

handsomecui

公告