baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-09-16 20:05:26 +00:00
Code Releases Activity

275. 传纸条

Browse Source 
https://www.acwing.com/problem/content/submission/code_detail/8784330/
This commit is contained in:
Baoshuo Ren 2021-11-12 16:55:24 +08:00 committed by Baoshuo Ren
parent 5a06e2f5d6
commit f929e9d580
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/275/275.cpp Normal file
View File

@ -0,0 +1,26 @@
#include <bits/stdc++.h>
using namespace std;
int n, m, w[55][55], f[55][55][55][55];
int main() {
cin >> m >> n;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
cin >> w[i][j];
}
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
for (int k = i + 1; k <= m; k++) {
for (int l = 1; l < j; l++) {
f[i][j][k][l] = max({f[i - 1][j][k - 1][l], f[i - 1][j][k][l - 1], f[i][j - 1][k - 1][l], f[i][j - 1][k][l - 1]}) + w[i][j] + w[k][l];
if (i == j && k == l) f[i][j][k][l] -= w[i][j];
}
}
}
}
cout << f[m - 1][n][m][n - 1] << endl;
return 0;
}