hdu 1505 City Game

City Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 5282    Accepted Submission(s): 2266

Problem Description

Bob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees,factories and buildings. There is still some space in the area that is unoccupied. The strategic task of his game is to win as much rent money from these free spaces. To win rent money you must erect buildings, that can only be rectangular, as long and wide as you can. Bob is trying to find a way to build the biggest possible building in each area. But he comes across some problems – he is not allowed to destroy already existing buildings, trees, factories and streets in the area he is building in.

Each area has its width and length. The area is divided into a grid of equal square units.The rent paid for each unit on which you're building stands is 3$.

Your task is to help Bob solve this problem. The whole city is divided into K areas. Each one of the areas is rectangular and has a different grid size with its own length M and width N.The existing occupied units are marked with the symbol R. The unoccupied units are marked with the symbol F.

 

Input

The first line of the input contains an integer K – determining the number of datasets. Next lines contain the area descriptions. One description is defined in the following way: The first line contains two integers-area length M<=1000 and width N<=1000, separated by a blank space. The next M lines contain N symbols that mark the reserved or free grid units,separated by a blank space. The symbols used are:

R – reserved unit

F – free unit

In the end of each area description there is a separating line.

 

Output

For each data set in the input print on a separate line, on the standard output, the integer that represents the profit obtained by erecting the largest building in the area encoded by the data set.

 

Sample Input

25 6R F F F F FF F F F F FR R R F F FF F F F F FF F F F F F5 5R R R R RR R R R RR R R R RR R R R RR R R R R

 

Sample Output

450

 

Source

Southeastern Europe 2004 

此题是1506的加强版，首先求出以第i行为底向上所能达到的最大高度，然后就转化为了1506，分别以第i行的每一点为最低点，向两边延伸，求出最大延伸距离再乘以该点的最大高度即是面积。求出面积的最大值。

#include <iostream>#include <cstring>using namespace std;#define N 1005int map[N][N], r[N], l[N];int main(){    int t, m, n;    int i, j;    int sum, maxn;    char ch[2];    cin>>t;    while(t--)    {        cin>>m>>n;        memset(map,0,sizeof(map));        for(i=1; i<=m; i++)            for(j=1; j<=n; j++)            {                cin>>ch;                if(ch[0] == 'R')                    map[i][j] = 0;                else                    map[i][j] = map[i-1][j]+1;            }        maxn = -1;        for(i=1; i<=m; i++)        {            for(j=1; j<=n; j++)                r[j] = l[j] = j;            map[i][0] = map[i][n+1] = -1;            for(j=n; j>=1; j--)                while(map[i][j] <= map[i][r[j]+1])                    r[j] = r[r[j]+1];            for(j=1; j<=n; j++)                while(map[i][j] <= map[i][l[j]-1])                    l[j] = l[l[j]-1];            for(j=1; j<=n; j++)            {                sum = map[i][j]*(r[j]-l[j]+1);                maxn = max(maxn,sum);            }        }        cout<<maxn*3<<endl;    }    return 0;}