 |
| ||||
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 | |||||||||
见内In Reply To:Re:这题DFS寻找增广路径可以么 Posted by:xming at 2007-07-31 18:07:47 将n个请求分成2n个事件，一种请求厅房，一种释放厅房，按发生时间排序，时间相同的请求事件在前。 dp[i][j]表示第i个事件发生使得使用厅房的状态为j 可不可能。 j的二进制形式表示各厅房的使用状态。 剩下的状态转移就比较好想了吧。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
