ABCPATH  ABC Path
You will be given a 2dimensional grid of letters. Find the length of the longest path of consecutive letters, starting at 'A'. Paths can step from one letter in the grid to any adjacent letter (horizontally, vertically, or diagonally).
For example, in the following grid, there are several paths from 'A' to 'D', but none from 'A' to 'E':
One such path is:
Input
Each test case will start with a line contains two integers H, W the height and width of the grid respectively 1 <= H, W <= 50. Then H lines follow each of W uppercase letters only. Input terminates with H = 0 and W = 0.
Output
For each test case print “Case C: X” without quotes where C is the case number starting with 1 and X is the solution.
Example
Sample Input: 4 3 ABE CFG BDH ABC 0 0 Sample Output: Case 1: 4
hide comments
andyy143:
20190629 18:25:07
@shiv pratap singh


andyy143:
20190629 18:17:05
will anyone explain me why this is giving wrong ans


shahayush457:
20190618 15:47:30
Good problem to practice on dfs on 2D and a bit of dp required.... 

scolar_fuad:
20190528 07:58:45
me_milan thank you so much without memorize got two time TLE >>


epsilon30:
20190520 19:06:51
dont go back to A after Z caused me 2 WAs . :( 

viru_31:
20190418 22:10:08
please anyone can tell me that how to apply dfs in this problem


gs959_me:
20190404 15:22:46
AC in one go


srthere:
20190131 04:41:53
Last edit: 20190204 13:33:11 

me_milan_11:
20190114 09:11:03
Didn't use memo and got 2 TLEs. Then AC 

gaurav1614:
20181226 18:08:22
DP on graphs.easily solvable in O(n*m) complexity. 
Added by:  Ali Arous 
Date:  20111105 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  FCIS Local Contest 2012 