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
karthik1997:
20151229 17:44:26
Dp . Best one for beginners though . For Similar approach  @http://www.geeksforgeeks.org/dynamicprogrammingset6mincostpath/


arjun:
20151226 10:04:23
Simple DP.


knightwood:
20151224 09:23:26
awesome beginner's problem 

Akanksha Thareja:
20151223 21:57:10
AC in one go! Easiest in dp. :D 

AASHISH KUMAR:
20151222 05:09:29
ac in 1 go first dp problem :D 

Junaid:
20151221 22:41:51
AC finally


sushmitkumar:
20151213 22:32:11
simple problem. messed up input test cases. spaces and/or new lines do not follow the description given in input. 

aloochaat1998:
20151213 04:00:51
ac in 1 go :) Last edit: 20151213 04:15:46 

rahul:
20151210 17:49:00
Can someone tell me how i would parse input in python


Timmy Jose:
20151202 16:25:54
Yes! At long last I'm getting the hang of DP. Still sticking to recursive solutions though (with memoisation). Next step  iterative DP! :D 
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 