
Floyd
文章平均质量分 85
J_Sure
唯苦修深思方能顿悟
展开
-
【最大流+最短路+二分】POJ-2112 Optimal Milking
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000K Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the c原创 2014-09-19 13:05:26 · 830 阅读 · 0 评论 -
POJ-1125 Stockbroker Grapevine
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000K DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a me原创 2014-08-16 11:28:22 · 754 阅读 · 0 评论 -
POJ-2472 106 miles to Chicago
106 miles to ChicagoTime Limit: 2000MS Memory Limit: 65M Special JudgeDescriptionIn the movie "Blues Brothers", the orphanage where Elwood and Jack were ra原创 2014-08-16 00:04:24 · 1001 阅读 · 0 评论 -
POJ-2263 Heavy Cargo
Heavy CargoTime Limit: 1000MS Memory Limit: 65536K DescriptionBig Johnsson Trucks Inc. is a company specialized in manufacturing big trucks. Their latest model,原创 2014-08-15 16:06:35 · 1052 阅读 · 0 评论 -
POJ-1603 Risk
RiskTime Limit: 1000MS Memory Limit: 10000K DescriptionRisk is a board game in which several opposing players attempt to conquer the world. The gameboard consis原创 2014-08-16 11:30:44 · 898 阅读 · 0 评论 -
POJ-2570 Fiber Network
Fiber NetworkTime Limit: 1000MS Memory Limit: 65536K DescriptionSeveral startup companies have decided to build a better Internet, called the "FiberNet". They h原创 2014-08-15 15:39:00 · 784 阅读 · 0 评论 -
POJ-2253 Frogger
FroggerTime Limit: 1000MS Memory Limit: 65536K DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitti原创 2014-08-15 17:10:09 · 808 阅读 · 0 评论 -
Floyd模板
/*ID: j.sure.1PROG:LANG: C++*//****************************************/#include #include #include #include #include #include #include #include #include #include #include #include #d原创 2014-08-12 22:08:24 · 782 阅读 · 0 评论 -
ZOJ-1232 Adventure of Super Mario
Adventure of Super MarioTime Limit: 2 Seconds Memory Limit: 65536 KB After rescuing the beautiful princess, Super Mario needs to find a way home -- with the princess of course :-) He's原创 2014-08-13 19:28:49 · 958 阅读 · 0 评论 -
HDU-1385 Minimum Transport Cost
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionThese are N cities in Spring country. Between each pair of citie原创 2014-08-13 00:32:25 · 937 阅读 · 0 评论 -
【最大流+最短路+二分】POJ-2391 Ombrophobic Bovines
Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536K DescriptionFJ's cows really hate getting wet so much that the mere thought of getting caught in the r原创 2014-09-20 20:14:08 · 785 阅读 · 0 评论 -
POJ-2404 Jogging Trails (中国邮递员)
Jogging TrailsTime Limit: 1000MS Memory Limit: 65536K DescriptionGord is training for a marathon. Behind his house is a park with a large network of jogging tra原创 2014-09-13 21:18:06 · 1537 阅读 · 0 评论