public class Solution {
public int MinFallingPathSum(int[][] A) {
int n = A.GetLength(0);
int[,] dp = new int[n,n];
int min = int.MaxValue;
for (int j = 0; j < n; j++)
{
dp[0,j] = A[0,j];
}
for (int i = 1; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (j - 1 < 0)
{
dp[i,j] = Math.Min(dp[i - 1,j], dp[i - 1,j + 1]) + A[i,j];
}
else if (j == n - 1)
{
dp[i,j] = Math.Min(dp[i - 1,j - 1], dp[i - 1,j]) + A[i,j];
}
else
{
dp[i,j] = Math.Min(Math.Min(dp[i - 1,j - 1], dp[i - 1,j]), dp[i - 1,j + 1]) + A[i,j];
}
}
}
for(int i=0;i<n;i++)
{
min = Math.Min(min, dp[n - 1,i]);
}
return min;
}
}