摘要：
Problem B: The Largest CliqueGiven a directed graph G, consider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Create a directed edge between two vertices u and v in T(G) if and only if there is a path between u and v in G that follows the directed edg 阅读全文
摘要：
Mining Your Own BusinessTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 769Accepted Submission(s): 97Problem DescriptionJohn Digger is the owner of a large illudium phosdex mine. The mine is made up of a series of tunnels that meet at various large 阅读全文