题目链接:https://www.luogu.org/problemnew/show/P4147#sub
悬线法的模板题,下面主要讲悬线法:
悬线法思路:悬线的定义,就是一条竖线,这条竖线要满足上端点在整个矩形上边界或者是一个障碍点。然后以这条悬线进行左右移动,直到移至障碍点或者是矩阵边界,进而确定这条悬线所在的极大矩阵。
具体方法:
先预处理:
用数组l,r记录某点向左和向右能到达的最远点的纵坐标。 用数组up记录某点向上能到达的最远距离。
//处理l
for (int i=1; i<=n; i++)
for (int j=2; j<=m; j++)
if (map[i][j]==1 && map[i][j-1]==1) l[i][j]=l[i][j-1];
//处理r
for (int i=1; i<=n; i++)
for (int j=m-1; j>=1; j--)
if (map[i][j]==1 && map[i][j+1]==1) r[i][j]=r[i][j+1];
对每一个点找最大面积:
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
if (map[i][j]==2) continue;
if (i>1 && map[i][j]==1 && map[i-1][j]==1) {
l[i][j]=max(l[i][j], l[i-1][j]);
r[i][j]=min(r[i][j], r[i-1][j]);
up[i][j]=up[i-1][j]+1;
}
ans=max(ans, (r[i][j]-l[i][j]+1)*up[i][j]);
}
}
最后是AC代码:
#include<iostream>
using namespace std;
const int N=1e3+10;
int n, m, ans, map[N][N];
int l[N][N], r[N][N], up[N][N];
int min(int x, int y) {
return x>y?y:x;
}
int max(int x, int y) {
return x>y?x:y;
}
int main() {
string s;
cin >> n >> m;
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
cin >> s;
if (s=="F") map[i][j]=1;
else map[i][j]=2;
l[i][j]=r[i][j]=j;
up[i][j]=1;
}
}
for (int i=1; i<=n; i++)
for (int j=2; j<=m; j++)
if (map[i][j]==1 && map[i][j-1]==1) l[i][j]=l[i][j-1];
for (int i=1; i<=n; i++)
for (int j=m-1; j>=1; j--)
if (map[i][j]==1 && map[i][j+1]==1) r[i][j]=r[i][j+1];
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
if (map[i][j]==2) continue;
if (i>1 && map[i][j]==1 && map[i-1][j]==1) {
l[i][j]=max(l[i][j], l[i-1][j]);
r[i][j]=min(r[i][j], r[i-1][j]);
up[i][j]=up[i-1][j]+1;
}
ans=max(ans, (r[i][j]-l[i][j]+1)*up[i][j]);
}
}
cout << ans*3;
return 0;
}
总结:其实悬线法还是比较基础的,理解起来也很好理解。
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
补充一道悬线法的题目:
https://www.luogu.org/problemnew/show/P1169
这是代码:
#include<iostream>
using namespace std;
const int N=2e3+10;
int n, m, ans1, ans2, map[N][N];
int l[N][N], r[N][N], up[N][N];
int main() {
cin >> n >> m;
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
cin >> map[i][j];
l[i][j]=j;
r[i][j]=j;
up[i][j]=1;
}
}
for (int i=1; i<=n; i++)
for (int j=2; j<=m; j++)
if (map[i][j]!=map[i][j-1]) l[i][j]=l[i][j-1];
for (int i=1; i<=n; i++)
for (int j=m-1; j>=1; j--)
if (map[i][j]!=map[i][j+1]) r[i][j]=r[i][j+1];
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++) {
if (i>1) {
if (map[i][j]!=map[i-1][j]) {
l[i][j]=max(l[i][j], l[i-1][j]);
r[i][j]=min(r[i][j], r[i-1][j]);
up[i][j]=up[i-1][j]+1;
}
}
ans1=max(ans1, min(r[i][j]-l[i][j]+1, up[i][j])*min(r[i][j]-l[i][j]+1, up[i][j]));
ans2=max(ans2, (r[i][j]-l[i][j]+1)*up[i][j]);
}
}
cout << ans1 << endl << ans2;
return 0;
}
只需要稍作修改便能够A掉。