ACM----【二分+贪心】
文章平均质量分 67
iviko
这个作者很懒,什么都没留下…
展开
-
L贪心基础
/*L - 贪心 基础Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major原创 2014-07-14 22:24:15 · 595 阅读 · 0 评论 -
二分C
/*C - 二分 基础Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIt is very hard to wash and especially to dry clothes in winter. But Jane is a ver转载 2014-07-15 17:58:38 · 441 阅读 · 0 评论 -
J贪心
/*J - 贪心 基础Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription“今年暑假不AC?” “是的。” “那你干什么呢?” “看世界杯呀,笨蛋!” “@#$%^&*%...” 确实如此,世界杯来了,球迷的节日也来了,估计很原创 2014-07-14 22:23:28 · 680 阅读 · 0 评论 -
二分基础
/*A - 二分 基础Time Limit:15000MS Memory Limit:228000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe SUM problem can be formulated as follows: given four lists A, B, C, D of inte原创 2014-07-14 22:25:50 · 566 阅读 · 0 评论 -
01背包(就地滚动)
/*__________________________________________________________________________________________________* copyright: Grant Yuan原创 2014-07-18 17:02:24 · 683 阅读 · 0 评论 -
二分lower_bound()与upper_bound()的运用
/*G - 二分Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionGiven n points (1 dimensional) and q segments, you have to find the number of points th原创 2014-07-16 14:08:29 · 720 阅读 · 0 评论 -
二分PKU3273
/*F - 二分Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFarmer John is an astounding accounting wizard and has realized he might run out of mo原创 2014-07-16 13:01:40 · 667 阅读 · 0 评论 -
B二分
/*B - 二分 基础Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFarmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stal原创 2014-07-15 17:57:00 · 620 阅读 · 0 评论 -
D二分
/*D - 二分 基础Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInhabitants of the Wonderland have decided to hold a regional programming contest.原创 2014-07-15 17:55:16 · 699 阅读 · 0 评论 -
二分PkU3258
/*E - 二分Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that invo原创 2014-07-16 11:01:39 · 559 阅读 · 0 评论 -
K贪心
/*K - 贪心 基础Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the原创 2014-07-14 22:22:50 · 658 阅读 · 0 评论