摘要：
DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest s 阅读全文
摘要：
分类是DP，可是却用暴力枚举过了，继续找思路。。。下面是纯暴力： 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #include <iostream> 5 #define MAX(a,b) (a) > (b)? (a):(b) 6 #define MIN(a,b) (a) < (b)? (a):(b) 7 #define mem(a) mem(a,0,sizeof(a)) 8 #define INF 1000000007 9 #define MAXN 阅读全文