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 |
水题花了好久……f[i]= min (f[i-1]+1, f[k]+w(k+1,i)) w表示k+1~i匹配成功需要删除的最少个数 本来枚举了k,结果超时。。改成从i开始直接往前匹配63ms 汗。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator