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 |
树形DP,AC了,谢谢提醒,刚开始做最大流做最小点覆盖所有的边,WA了,以前做过覆盖边的。In Reply To:这组数据说明了点覆盖和边覆盖的不同。。 wrong滴看 Posted by:nenu_cs_11yanyao at 2012-08-18 09:49:43 > 11 > 1 2 > 1 3 > 1 4 > 1 5 > 3 6 > 6 7 > 7 8 > 7 9 > 7 10 > 7 11 > 点 > ans=2 > 边 > ans=3 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator