又是雷
by Lance1ot @ 2018-10-06 20:45:45
经校验，问题出在
```cpp
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
// printf("%d %d\n",i,f[i][j-1]);
f[i][j]=max(f[i][j],f[i][j-1]+list[d[j]][5]);
// printf("%d ",f[i][j]);
f[i][j]=max(f[i][j],f[i-1][j]+list[c[i]][5]);
// printf("%d\n",f[i][j]);
f[i][j]=max(f[i][j],f[i-1][j-1]+list[c[i]][d[j]]);
}
```
中对于f[i][j]的更新上
by 霹雳搅屎棍 @ 2018-10-06 20:45:46
@[霹雳搅屎棍](/space/show?uid=102673) 我视力4.2QAQ
by skiy_gyx @ 2018-10-06 20:46:52
**300度眼睛，对我这个五年级小蒟蒻太可怕了**
by skiy_gyx @ 2018-10-06 20:47:34
对于f[i][j-1]:
```
-3
0
0
0
0
0
0
0
0
0
-4
2
0
0
0
0
5
1
5
5
-8
0
0
0
5
2
1
10
9
8
-9
0
0
0
4
4
7
9
15
14
-12
0
0
0
1
9
8
6
12
14
-15
0
0
0
0
6
8
7
9
11
-18
0
0
0
0
5
5
7
6
8
-20
0
5
5
1
3
3
5
5
6
-24
0
1
2
10
7
6
8
7
6
-28
0
0
0
7
9
8
11
10
9
```
正解:
-3
-1
-3
-5
-6
-4
-5
-9
-10
-11
-4
2
0
-2
-6
-5
1
-3
-4
-5
-8
-2
-1
-3
3
0
-1
6
5
4
-9
-3
-2
-3
2
2
5
5
11
10
-12
-6
-5
-4
-1
7
6
4
8
10
-15
-9
-8
-7
-4
4
6
5
5
7
-18
-12
-11
-10
-7
1
3
5
4
4
-20
-14
-7
-6
-9
-1
1
3
3
2
-24
-18
-11
-10
-1
-4
-3
6
5
4
-28
-22
-15
-14
-5
-2
-3
2
4
3
```
by 霹雳搅屎棍 @ 2018-10-06 20:50:44
所以问题在哪
by Ykimna @ 2019-01-18 11:09:06
f数组初值设为-inf即可
by starAndHonor @ 2022-01-26 13:52:13