 |
| ||||
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 | |||||||||
Re:征集算法。。In Reply To:征集算法。。 Posted by:sunny_fable at 2007-05-16 14:57:03 第一个问先求割顶集S，然后对每个S的节点作root DFS枚举。好像很慢，O(n^2+n*m)，期待好方法。 第二个问可以用DP，就是树状DP的同时做一个0/1背包，同样期待好方法。。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
