u013246297的专栏

Problem Description    FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room c

F - Integer Intervals Time Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%I64d & %I64u SubmitStatus Description An integer interval [a,b], a < b, is a set of all consecutive inte

先读懂题意，先排序，在相加，贪心算法重在思路。 I - Commando War Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Description G Commando War Input:

B - 最少拦截系统 Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u SubmitStatus Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前

E - Wooden Sticks Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u SubmitStatus Description There is a pile of n wooden sticks. The length and weight of each sti

刷水题，找自信。。。 Holding Bin-Laden Captive! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16075    Accepted Submission(s): 7212 Problem Des