首页 > ACM题库 > HDU-杭电 > HDU 1505 City Game-动态规划-[解题报告] C++
2013
12-12

HDU 1505 City Game-动态规划-[解题报告] C++

City Game

问题描述 :

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.

输入:

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.

输出:

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.

样例输入:

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

样例输出:

45
0

题意:就是让你求出全由F组成的最大子矩阵。

分析:这是hdu 1506的加强版,只不过这道题变成了2维的,那我们就一行一行的来。具体的分析见1506的博客:http://www.cnblogs.com/jiangjing/p/3221423.html

然后做了这题之后,就可以做下这道题的加强版了:hdu 2870

代码实现:

#include<iostream>
#include<string.h>
using namespace std;
int n,m;
char map[1005][1005];
int a[1005][1005],l[1005],r[1005];
int main()
{
    int T,i,j,max,t;
    scanf("%d",&T);
    {
        while(T--)
        {
            max=-1;
            scanf("%d%d",&n,&m);
            getchar();
            for(i=1;i<=n;i++)
                for(j=1;j<=m;j++)
                   cin>>map[i][j];
            for(i=1;i<=m;i++)
                a[0][i]=0;
            for(i=1;i<=m;i++)
            {
                for(j=1;j<=n;j++)
                {
                    if(map[j][i]=='F')
                        a[j][i]=a[j-1][i]+1;
                    else
                        a[j][i]=0;
                }
            }
            for(i=1;i<=n;i++)
            {
                l[1]=1;r[m]=m;
                for(j=2;j<=m;j++)
                {
                    if(a[i][j]==0)
                        continue;
                    t=j;
                    while(t>1&&a[i][j]<=a[i][t-1])
                        t=l[t-1];
                    l[j]=t;
                }
                for(j=m-1;j>=1;j--)
                {
                    if(a[i][j]==0)
                        continue;
                    t=j;
                    while(t<m&&a[i][j]<=a[i][t+1])
                        t=r[t+1];
                    r[j]=t;
                }
                for(j=1;j<=m;j++)
                    if((r[j]-l[j]+1)*a[i][j]>max)
                        max=(r[j]-l[j]+1)*a[i][j];
            }
            printf("%d\n",max*3);
        }
    }
    return 0;
}

 

 

解题报告转自:http://www.cnblogs.com/jiangjing/p/3221442.html