算法竞赛入门经典 每日一题(3029 City Game)

 

 

思路：

扫描 从下到上 从左到右 从右到左 得出每个点的 运动极限

const int MAX=1010;
int n,m;
int a[MAX][MAX];
int up[MAX][MAX];
int l[MAX][MAX];
int r[MAX][MAX];
int main(){
    cin>>n>>m;
    over(i,0,n-1){
        over(j,0,m-1){
            char c;
            c=getchar();
            a[i][j]=c=='F'?0:1;
        }
    }
    int ans=0;
    over(i,0,n-1)
    {
        int lo=-1;
        int ro=m;
        over(j,0,m-1){
            if(a[i][j]==1){
                up[i][j]=l[i][j]=0;
                lo=j;
            }
            else {
                up[i][j]=i==0?1:up[i-1][j]+1;
                l[i][j]=i==0?lo+1:max(lo+1,l[i-1][j]);
            }
        }
        over(j,m-1,0){
            if(a[i][j]==1) {
                r[i][j]=m;
                ro=j;
            }
            else {
                r[i][j]=i==0?ro-1:min(r[i-1][j],ro-1);
                ans=max(ans,up[i][j]*(r[i][j]-l[i][j]+1));
            }
        }
    }
    cout<<ans;
}