WA3个点
by Adove @ 2018-04-27 09:52:53
## 蒟蒻 Orz dalao
by qqvq @ 2018-04-27 09:59:03
空间优化后
```cpp
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=1055;
int n,m,ans;
int h[MAXN],l[MAXN],r[MAXN];
char ch;
bool b[MAXN];
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
scanf("\n%c",&ch);
if(ch=='R') b[j]=1;
else b[j]=0;
}
for(int j=1;j<=m;++j){
if(!b[j]) ++h[j];
else h[j]=0;
}
for(int j=m;j;--j){
if(!b[j]){
if(j==m) r[j]=m;
else if(h[j]>1) r[j]=min(r[j],r[j+1]);
else r[j]=r[j+1];
}else r[j]=j-1;
}
for(int j=1;j<=m;++j){
if(!b[j]){
if(j==1) l[j]=1;
else if(h[j]>1) l[j]=max(l[j],l[j-1]);
else l[j]=l[j-1];
}else l[j]=j+1;
}
for(int j=1;j<=m;++j) ans=max((r[j]-l[j]+1)*h[j],ans);
}
printf("%d\n",ans*3);
return 0;
}
```
by Adove @ 2018-04-27 12:26:58
@A·H
by 冰桨 @ 2019-03-21 16:58:48