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
chakkriii:
20160609 09:05:27
AC in 1st go,


get_right_jr:
20160604 19:58:43
Bottomup in 0.08 in Java :)


setoh:
20160518 10:49:26
Got RTE in python, looks like a problem on the input formats ... go with c++ guys 

jitendrakk:
20160517 18:17:44
First DP problem with first time AC.. :) 

atif_11:
20160517 15:50:51
No need long long int....AC in 1st go with 0(n^2) 

avisheksanvas:
20160517 12:10:04
Try Miserman before or after this :)


lt:
20160324 08:57:58
Edit: I don't why it's getting tle in java and python, while the same algo in c++ gets submitted!


pvsmpraveen:
20160323 13:51:20
Got AC! with Dpiterative and DpRecursion with Memorisation


ujjax:
20160320 08:23:26


harshitdd120:
20160310 20:41:23
Finally Solved my first DP problem

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 