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:在这个方法的基础上修改一下就可以了 Posted by:ACM07001 at 2007-03-03 11:01:13 > > 随着时间的不断增加,不断加入代表门的点 > 第i天第j个门,设为i*DoorSum+j > > match[x]=y;表示标号为x的人在第y/DoorSum天从第y%DoorSum个门里出去 > > 用dfs(i*DoorSum+j)就可以了 > > 只要dfs DoorSum*MaxDay 次就可以了 > > ps:你的这个例子是数据中的某一个吧!呵呵 > > Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator