baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 03:31:59 +00:00
Code Releases Activity

1018. 最低通行费

Browse Source 
https://www.acwing.com/problem/content/submission/code_detail/8757904/
This commit is contained in:
Baoshuo Ren 2021-11-11 09:09:06 +08:00 committed by Baoshuo Ren
parent 4b56a7a6b7
commit 538569394d
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 26 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
AcWing/1018/1018.cpp Normal file
View File

@ -0,0 +1,26 @@
#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;
}