摘要：
For Beginners如图：1.dfs Beginners2.shortest Path3.mst4.Bipartite Graph Matching5.Network Flow 阅读全文
摘要：
Street DirectionsAccording to the Automobile Collision Monitor (ACM), most fatal traffic accidents occur on two-way streets. In order to reduce the number of fatalities caused by traffic accidents, the mayor wants to convert as many streets as possible into one-way streets. You have been hired to p. 阅读全文
摘要：
Problem D: DominosDominos are lots of fun. Children like to stand the tiles on their side in long lines. When one domino falls, it knocks down the next one, which knocks down the one after that, all the way down the line. However, sometimes a domino fails to knock the next one down. In that case, we 阅读全文
摘要：
PartyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3521Accepted Submission(s): 1141Problem Description有n对夫妻被邀请参加一个聚会，因为场地的问题，每对夫妻中只有1人可以列席。在2n 个人中，某些人之间有着很大的矛盾（当然夫妻之间是没有矛盾的），有矛盾的2个人是不会同时出现在聚会上的。有没有可能会有n 个人同时列席？Inputn： 表示有n对夫妻被邀请 (n#include#includ 阅读全文