摘要: ParatroopersTime Limit:2 Seconds Memory Limit:32768 KBIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in them * ngrid yard of one 阅读全文
posted @ 2013-08-20 16:26 哥的笑百度不到 阅读(378) 评论(0) 推荐(0) 编辑
摘要: Optimal MilkingTime Limit:2000MSMemory Limit:30000KTotal Submissions:10100Accepted:3672Case Time Limit:1000MSDescriptionFJ has moved his K (1 15, a row is broken into successive lines of 15 numbers and a potentially shorter line to finish up a r... 阅读全文
posted @ 2013-08-20 15:02 哥的笑百度不到 阅读(237) 评论(0) 推荐(0) 编辑
摘要: 样例输入: 6 10 0 1 8 2 0 2 4 3 1 3 2 2 1 4 2 2 2 1 4 2 2 3 1 1 2 4 4 0 3 4 6 0 3 5 9 3 4 5 7 2样例输出:0->1 : 40->2 : 41->3 : 21->4 : 22->1 : 02->3 : 12->4 : 33->4 : 03->5 : 34->5 : 5maxFlow : 8#include #include #include #define MAXN 1000 //顶点个数最大值#define INF 1000000 //无穷大#defi 阅读全文
posted @ 2013-08-20 09:37 哥的笑百度不到 阅读(475) 评论(0) 推荐(0) 编辑