BYTESM2  Philosophers Stone
One of the secret chambers in Hogwarts is full of philosopher’s stones. The floor of the chamber is covered by h × w square tiles, where there are h rows of tiles from front (first row) to back (last row) and w columns of tiles from left to right. Each tile has 1 to 100 stones on it. Harry has to grab as many philosopher’s stones as possible, subject to the following restrictions:
 He starts by choosing any tile in the first row, and collects the philosopher’s stones on that tile. Then, he moves to a tile in the next row, collects the philosopher’s stones on the tile, and so on until he reaches the last row.
 When he moves from one tile to a tile in the next row, he can only move to the tile just below it or diagonally to the left or right.
Input
The first line consists of a single integer T, the number of test cases. In each of the test cases, the first line has two integers. The first integer h (1 <= h <= 100) is the number of rows of tiles on the floor. The second integer w (1 <= w <= 100) is the number of columns of tiles on the floor. Next, there are h lines of inputs. The ith line of these, specifies the number of philosopher’s stones in each tile of the ith row from the front. Each line has w integers, where each integer m (0 <= m <= 100) is the number of philosopher’s stones on that tile. The integers are separated by a space character.
Output
The output should consist of T lines, (1 <= T <= 100), one for each test case. Each line consists of a single integer, which is the maximum possible number of philosopher’s stones Harry can grab, in one single trip from the first row to the last row for the corresponding test case.
Example
Input: 1 6 5 3 1 7 4 2 2 1 3 1 1 1 2 2 1 8 2 2 1 5 3 2 1 4 4 4 5 2 7 5 1 Output: 32 //7+1+8+5+4+7=32
hide comments
Rodney Ledo Ramírez:
20130918 01:36:46
Please i need some tricky test cases, i test mi solution and seems to be correct but i getting WA 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20130821 05:12:32
Input formatting is very bad.. need a lot of submissions to get it properly. And finally #3 best solver ;) 

Nabil:
20130714 09:18:05
I had no idea it was DP... I just got accepted on the first time :D nice problem 

Himanshu:
20130625 18:26:08
my frist dynamic programming.......


me codesta a.k.a w@s!m:
20130530 15:30:09
piece of cake:) MISERMAN and this both 

Karunanidhi:
20130328 20:02:16
simplest DP :) 

Pandian:
20130314 16:35:10
Weak test case ! 

Rajagopal:
20130108 13:08:38
Got AC :) :) :)


Arianto Wibowo:
20130107 11:46:49
getchar get WA, use scanf :) 
Added by:  Paritosh Aggarwal 
Date:  20090221 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PASGPC PASFPC PERL PHP PIKE PRLGswi PYTHON RUBY SCM qobi SCM guile ST TEXT WHITESPACE 