@[Time_grow](/space/show?uid=39009)
```cpp
for(int i = 1;i <= n ; i++)//i应该能到m
for(int j = i ; j <= m ; j++){
long long sum = 0;
for(int k = 1 ; k <= n ; k++){
if(sum < 0) sum = 0;
sum += a[k][j] - a[k][i-1];
if(maxx < sum)
maxx = sum;
}
}
```
by maomao @ 2019-10-21 23:07:42
我把你的代码改了以后交了，100points
~~算我做的吗~~
by maomao @ 2019-10-21 23:08:52
@[maomao](/space/show?uid=50215) 他不是n行m列吗qwq？
by Time_grow @ 2019-10-21 23:09:26
@[maomao](/space/show?uid=50215) qwq？？？我试试啊
by Time_grow @ 2019-10-21 23:09:41
真的A了。。。qwq？？好迷呀
by Time_grow @ 2019-10-21 23:10:15
@[Time_grow](/space/show?uid=39009)
```cpp
for(int i = 1;i <= n ; i++)//i应该能到m
for(int j = i ; j <= m ; j++){
long long sum = 0;
for(int k = 1 ; k <= n ; k++){
if(sum < 0) sum = 0;
sum += a[k][j] - a[k][i-1];//你把i当成第二维的变量了
if(maxx < sum)
maxx = sum;
}
}
```
by maomao @ 2019-10-21 23:10:32
这里i的意义是第二维
by maomao @ 2019-10-21 23:10:53
@[maomao](/space/show?uid=50215) 噗...我懂了，谢谢dalao
by Time_grow @ 2019-10-21 23:11:10
@[Time_grow](/space/show?uid=39009) 如果你是想练dp，就打个最大子矩阵
如果你单纯想做题，当我没说（逃
by maomao @ 2019-10-21 23:15:24