Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

发现挺多人说这个题有问题，我也来说两句吧

Posted by lianzhouxiaowu at 2010-11-22 22:57:39 on Problem 2553 
关键是这句话的意思 —— “A node v in a graph G=(V,E) is called a sink, if for every node w in G that is reachable from v, v is also reachable from w.” 大家好好体会这句话的意思吧
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator