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 TLE了~~用DP做的,TLE了~~ 我的做法是:每个R[i] 求出他的所有可能的组合(预处理先求完),假设总共有tot[i]个状态, best[i][j] 表示 R[i] 使用第 j 个状态的最优解。进行DP,还是TLE了~郁闷ing Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator