1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
| #include <iostream>
#include <cstring>
#define FAST ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
#define endl '\n'
#define debug(x) cout << #x << " = " << (x) << endl
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<=n;++i)
#define per(i,n,a) for(int i=n;i>=a;--i)
using namespace std;
const int maxn = 2e3+5;
int n, m;
short a[maxn][maxn];
bool b[maxn][maxn];
short up[maxn][maxn], down[maxn][maxn], len[maxn][maxn];
void tran() {
mem(b, 0);
rep(i, 1, n) {
rep(j, 1, m) {
if (i == 1) continue;
else if (a[i][j] >= a[i-1][j]) b[i][j] = 1;
}
}
}
void init() {
rep(i, 1, n) {
rep(j, 1, m) {
up[i][j] = i;
down[i][j] = i;
len[i][j] = 1;
}
}
}
int main()
{
FAST;
int t; cin >> t;
while (t--) {
cin >> n >> m;
rep(i, 1, n) {
rep(j, 1, m) {
cin >> a[i][j];
}
}
tran();
init();
rep(j, 1, m) {
rep(i, 2, n) {
if (b[i][j]) up[i][j] = up[i-1][j];
}
per(i, n-1, 1) {
if (b[i+1][j]) down[i][j] = down[i+1][j];
}
}
int ans = m;
rep(j, 1, m) {
rep(i, 1, n) {
if (b[i][j-1]) {
len[i][j] = len[i][j-1] + 1;
up[i][j] = max(up[i][j], up[i][j-1]);
down[i][j] = min(down[i][j], down[i][j-1]);
}
int llen = down[i][j] - up[i][j] + 1;
ans = max(ans, llen * len[i][j]);
}
}
cout << ans << endl;
}
return 0;
}
|
