0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-13 04:06:26 +00:00
OI-codes/AcWing/1018/1018.cpp

27 lines
567 B
C++

#include <bits/stdc++.h>
using namespace std;
int n, w[105][105], f[105][105];
int main() {
memset(f, 0x3f, sizeof(f));
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> w[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == 1 && j == 1) {
f[i][j] = w[i][j];
} else {
f[i][j] = min(f[i - 1][j], f[i][j - 1]) + w[i][j];
}
}
}
cout << f[n][n] << endl;
return 0;
}