注意对边缘元素的探索只能有一个维度

#include<iostream>
#include<cstring>
using namespace std;

const int N = 110;

int n;
int f[N][N] ={0};

int main(){
    cin>>n;
    memset(f,0x3f3f3f3f,sizeof f);
    f[0][1] = 0;
    f[1][0] = 0;
    for(int i=1;i <= n;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            cin>>f[i][j];
            f[i][j] = f[i][j] + min(f[i-1][j],f[i][j-1]);  
        }
    }
    cout<<f[n][n];
    return 0;
}