1018. 最低通行费

求最小值
数字三角形的变形

#include <iostream>
#include <cstdio>
using namespace std;
const int N = 110;
int f[N][N], w[N][N];

int main(){
    int n, x;
    scanf("%d",&n);
    for(int i = 1; i  <= n; i ++)
        for(int j = 1; j <= n; j++){
            scanf("%d", &x); 
           if(i == 1) f[i][j] = f[i][j-1] + x; //第一行只能从左边过来
           else if(j == 1) f[i][j] = f[i-1][j] + x; //第一列只能从上面下来
            else f[i][j] = min(f[i-1][j], f[i][j-1]) + x;
        }
    printf("%d\n", f[n][n]);
    return 0;
}