2011年02月_xieshimao

原创 POJ 3683 2-sat问题，不过要输出路径用topsort

Priest John's Busiest DayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3985 Accepted: 1394 Special Judge Description John is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend

2011-02-24 20:25:00 1119

原创 POJ 3207 2-sat

Ikki's Story IV - Panda's TrickTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3680 Accepted: 1330

2011-02-23 16:30:00 1142

原创 POJ 2112 floyd+二分答案+网络流

Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 4895 Accepted: 1874Case Time Limit: 1000MS DescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of path

2011-02-22 17:33:00 1118

原创 POJ 1459 网络流算法（EK）

Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 12578 Accepted: 6846 DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an a

2011-02-20 21:46:00 1391

原创 POJ 2631 最长路搜索，BFS

Roads in the NorthTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1352 Accepted: 666 DescriptionBuilding and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that ther

2011-02-19 20:38:00 1559

原创 POJ 2976 参数搜索

Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3042 Accepted: 964DescriptionI

2011-02-19 19:01:00 1556

原创 POJ 2613 组合数的比（好吧，我承认我又写复杂了）

Choose and divideTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3381 Accepted: 1097Description

2011-02-17 01:42:00 1219

原创 POJ 1904 强连通

King's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 3719 Accepted: 1251Case Time Limit: 2000MS DescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about

2011-02-15 17:53:00 1262

原创 POJ 2377 最大生成树 prim实现

Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6904 Accepted: 3008 DescriptionBessie has been hired to build

2011-02-14 14:46:00 6001

原创 POJ 3304 计算几何

SegmentsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3703 Accepted: 1026 Description Given n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on

2011-02-11 02:57:00 1372

原创 POJ 3660 floyd算法统计无关点个数

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3613 Accepted: 1911DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partici

2011-02-11 02:54:00 1030 2

原创 POJ 1068 括号模拟

ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11191 Accepted: 6590 DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn whe

2011-02-10 00:32:00 2838

原创 POJ 2955 DP动态规划

BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1659 Accepted: 831DescriptionWe give

2011-02-06 23:45:00 1551 1

原创 POJ 1789 最小生成树问题

Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8416 Accepted: 3027 DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The co

2011-02-06 20:14:00 1920

bingshen的专栏