Maze DP Code

//www.gammal.tech
#include <iostream>
#include <algorithm>
using namespace std;
int x[4][4]={{0 ,0 ,0 ,0},
---{0 ,10,15,1},
---{0 ,10,1 ,1},
---{0 ,10,10,10}};
int main() {
-for(int i=1; i<=3; i++)
--for(int j=1; j<=3; j++)
---x[i][j] += max(x[i-1][j], x[i][j-1]);
-cout<< x[3][3] <<endl;
}