Detail of message

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

写个BFS另类思路

Posted by CSUST_14 at 2013-04-19 09:28:06 on Problem 2248

数组ar[N][N] 中的ar[i][j] 表示以j结尾，并且经过i的最小长度

那么ar[i][j] 可以有下列方向走
   i---->j---->i+j 即有ar[i][i+j] = ar[i][j]+1;ar[j][i+j] = ar[i][j]+1;
   i---->j---->2*j 即有ar[i][2*j] = ar[i][j]+1;ar[j][2*j] = ar[i][j]+1;

Followed by:

Re:写个BFS另类思路 (261) 13436211 2014-08-09 10:50:33

Post your reply here:

Home Page Go Back To top