传送门(洛谷)
此题和
浙江那道 棋盘制作
一模一样
思路方法都是一个样子,代码都没怎么改,吐槽
参见我另一篇博客
给出代码
#include<bits/stdc++.h>
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define don(i,a,b) for(register int i=(a);i>=(b);i--)
#define ll long long
using namespace std;
const int maxn=1e5+10;
const int maxm=1e3+10;
int n,m;
int r[maxm][maxm],l[maxm][maxm],up[maxm][maxm],mapp[maxm][maxm];
template <class t> inline void read(t &x)
{
int f=1;x=0;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
x*=f;
}
bool get_data() {
while(1) {
char ch=getchar();
if(ch!='R' && ch!='F') continue;
if(ch=='F') return 1;
if(ch=='R') return 0;
}
}
void readdata() {
read(n);read(m);
rep(i,1,n) rep(j,1,m) {
mapp[i][j]=get_data();
l[i][j]=j;
r[i][j]=j;
up[i][j]=1;
}
/* rep(i,1,n) {
printf("\n");
rep(j,1,m)
printf("%d ",mapp[i][j]);
}*/
}
void work() {
rep(i,1,n) {
rep(j,2,m) {
if(mapp[i][j]==1 && mapp[i][j-1]==1) {
l[i][j]=l[i][j-1];
}
}
don(j,m-1,1) {
if(mapp[i][j]==1 && mapp[i][j+1]==1) {
r[i][j]=r[i][j+1];
}
}
}
int ans=0;
rep(i,1,n)
rep(j,1,m) {
if(mapp[i][j]==1 && mapp[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;
}
int a=r[i][j]-l[i][j]+1;
ans=max(ans,a*up[i][j]);
}
printf("%d\n",ans*3);
}
int main() {
freopen("input.txt","r",stdin);
readdata();
work();
return 0;
}