tarjan
clasky
这个作者很懒,什么都没留下…
展开
-
2013 杭电多校联合赛 第四场D题 4635 Strongly connected
Problem DescriptionGive a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is still a simple directed graph. Also, after yo原创 2013-08-03 13:23:19 · 796 阅读 · 0 评论 -
HDU 4587 TWONODES (tarjan) (2013ACM-ICPC南京赛区全国邀请赛)
TWO NODESTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 379 Accepted Submission(s): 142Problem DescriptionSuppose that G i原创 2013-09-09 09:18:26 · 1612 阅读 · 0 评论 -
Uva11324 The Largest Clique tarjan+dp
The Largest CliqueTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem B: The Largest Cl原创 2014-04-15 19:20:49 · 668 阅读 · 0 评论