 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
怎么解决啊？是不是一个点P有几个这样的下序点（在DFS形成的子树中下序点所能到达的访问最早的点的访问时间比此点P的访问时间还要晚），那去掉点P就能把它所在的连通图分为几个部分啊？ 只要找把自己所在的连通图分为尽量多的部分的点即可吧 ？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
