3029 - City Game

原创 2015年07月10日 17:26:06

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 file 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 file 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 

2
5 6
R F F F F F
F F F F F F
R R R F F F
F F F F F F
F F F F F F

5 5
R R R R R
R R R R R
R R R R R
R R R R R
R R R R R

Sample Output 

45
0
#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
const int MAXN = 1010;
bool mp[MAXN][MAXN];//1为石头
int Left[MAXN][MAXN],Right[MAXN][MAXN],up[MAXN][MAXN];
char read_char()
{
    char rt = getchar();
    while(true)
    {
        if(rt=='F'||rt=='R')return rt;
        rt = getchar();
    }
}
int main()
{
    int t, i, j, n, m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        memset(mp,1,sizeof mp);
        for(i=1; i<=n; i++)
        {
            for(j=1; j<=m; j++)
            {
                mp[i][j] = (read_char()=='R');
            }
        }
        int ans = 0;
        for(i=0; i<=n; i++)
        {
            int lo=0, ro = m+1;
            for(j=0; j<=m+1; j++)
            {
                if(mp[i][j])
                {
                    Left[i][j] = up[i][j] = 0; lo = j;
                }else{
                    Left[i][j] = max(Left[i-1][j],lo);
                    up[i][j] = up[i-1][j] + 1;
                }
            }
            for(j=m+1; j>=0; j--)
            {
                if(mp[i][j])
                {
                    Right[i][j] = m+1; ro = j;
                }else{
                    Right[i][j] = min(Right[i-1][j], ro);
                    ans = max(ans,up[i][j]*(Right[i][j]-Left[i][j]-1));
                }
            }
        }
        printf("%d\n", ans*3);
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

最大子矩阵,City Game,SEERC 2004,LA3029

给定一个MN的矩阵,其中一些格子是空地(F),其他是障碍(R),找出一个全部由F组成的面积最大的子矩阵。JAVA代码给出O(N^2)算法。 参考文献:《算法竞赛入门经典训练指南》P51,刘汝佳,...

UVALive 3029 City Game

和书上的思路是一样的,不再赘述了,每一次

hdu 1505 City Game(DP)

City Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tota...
  • caduca
  • caduca
  • 2014-08-29 23:07
  • 3516

【DP】 hdu1505 City Game

City Game http://acm.hdu.edu.cn/showproblem.php?pid=1505 Problem Description Bob is a s...

hdu1505 City Game--DP/栈

原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=1505 一:原题内容 Problem Description Bob i...

City Game

Description Bob is a strategy game programming specialist. In his new city building game the gaming...

单调栈优化dp:hdu1506Largest Rectangle in a Histogram &hdu1505city game dp

其实早在去年九月就做过这两个题了 hdu1506Largest Rectangle in a Histogram hdu1505city game dp 然而并不是用单调栈来优化的,一个很不好理...

HDU 1505 City Game(DP)

1506的升级版 只是多了一维 h要自己算 详情看上一篇

【DP+预处理|最长连续子序列】HDU-1505 City Game

给出一个01矩阵,求其中全部都是1的最大的子矩阵。

hdu 1505 dp City Game

嗯。主要就是记录一行比a[i]的高度高的相邻的长度。然后比较面积最大的。 那么,怎么记录。。。 如果,a[i]左边第一个的高度比a[i]高,那么,搜寻比a[i-1]高的、、、依次类推。若果,a[i...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)