 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
这种算法对吗?先对所有a+b求最大公约数，得到最大时间t1。然后在这段时间内做DP （a[t][i]代表t时刻i地址是否可达），每次检查a[t-1][j](0<=i-5<=j<=i-1)是否可达，有一个可达则a[t][i]可达。 请高人赐教啊，WA了好多次了。。。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
