Maximum path sum in matrix

//{ Driver Code Starts
// Initial Template for C++

#include <bits/stdc++.h>
using namespace std;

// } Driver Code Ends
// User function Template for C++

class Solution{
public:
    int maximumPath(int N, vector<vector<int>> Matrix)
    {
        // code here
        int n=N;
        for(int i=1;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                if(j>0 && j<n-1)
                {
                    Matrix[i][j]+=max({Matrix[i-1][j],Matrix[i-1][j-1],Matrix[i-1][j+1]});
                }
                else if(j>0)
                {
                    Matrix[i][j]+=max(Matrix[i-1][j],Matrix[i-1][j-1]);
                }
                else if(j<n-1)
                {
                    Matrix[i][j]+=max(Matrix[i-1][j],Matrix[i-1][j+1]);
                }
            }
        }
        int ans=0;
        for(int j=0;j<n;j++)
        {
            ans = max(Matrix[n-1][j],ans);
        }
        return ans;
    }
};

//{ Driver Code Starts.

int main(){
    int t;
    cin>>t;
    while(t--){
        int N;
        cin>>N;
        vector<vector<int>> Matrix(N, vector<int>(N, 0));
        for(int i = 0;i < N*N;i++)
            cin>>Matrix[(i/N)][i%N];

        Solution ob;
        cout<<ob.maximumPath(N, Matrix)<<"\n";
    }
    return 0;
}
// } Driver Code Ends