| ||||||||||
| 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 | |||||||||
E:ChannelIn Reply To:说一下今年的Final题吧,今年是DP题的聚会 Posted by:ACRush at 2010-02-05 11:50:44 E题:动态规划 这可能是一道决胜题,就是过了和不过差别很大。 状态就是之前10个点的情况,包括连通性,degree信息。 需要明白的是:一条链==连通+(n-2)个点度2+2个点度1。 相信SJTU和THU都知道,祝他们决胜吧。 状态数比较大,所以需要一些预处理。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator