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 |
Re:UP~~再问62MS的牛人怎么做的?如何优化?In Reply To:三维dp Posted by:ASCII at 2007-07-01 14:11:47 > f[i][j][k]:i表示走的步数,j表示此时所在一条路径的横坐标,k表示此时所在另一条路径的横坐标. > 然后纵坐标也就可以算出来了. > 选取这个状态dp可以过. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator