zoukankan      html  css  js  c++  java
  • HDU 1505 City Game(01矩阵 dp)

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

    Source
     

    Recommend
    zl   |   We have carefully selected several similar problems for you:  1069 1176 1864 1003 2571 
     



    #include<iostream>
    #include<cstring>
    #include<algorithm>
    #include<cstdio>
    #include<queue>
    #include<stack>
    using namespace std;
    
    #define N 1005
    
    int h[N][N],le[N],ri[N];
    int n,m;
    
    int main()
    {
    	int i,t,j;
    	scanf("%d",&t);
    	while(t--)
    	{
    
    		memset(h,0,sizeof(h)) ;
    		scanf("%d%d",&n,&m);
    		char c;
    		int ans=0;
    
    		for(i=1;i<=n;i++)
    			for(j=1;j<=m;j++)
    		{
    
    			cin>>c;
    			if(c=='F')
    				h[i][j]=h[i-1][j]+1;
    			else
    				h[i][j]=0;
    		}
    
    		for(i=1;i<=n;i++)
    		{
    			for(j=1;j<=m;j++)
    			{
    				le[j]=j;
    				while(le[j]>1&&h[i][le[j]]<=h[i][le[j]-1])
                        le[j]=le[le[j]-1];
    			}
    
    			for(j=m;j>=1;j--)
    			{
    				ri[j]=j;
    				while(ri[j]<m&&h[i][ri[j]]<=h[i][ri[j]+1])
    					ri[j]=ri[ri[j]+1];
    			}
    
    			for(j=1;j<=m;j++)
    				ans=max(ans,h[i][j]*(ri[j]-le[j]+1));
    		}
    
           printf("%d
    ",ans*3);
    	}
     return 0;
    }
    



    版权声明:本文博主原创文章,博客,未经同意不得转载。

  • 相关阅读:
    Android中开发习惯
    Activity、Window和View三者间的关系有一定的见解
    Android底层有一定的认识,研究过相关的Android源码
    安卓工程的启动过程
    OAuth2认证有一定的了解
    屏幕适配经验
    NOIP模拟赛14
    NOIP模拟赛13
    NOIP模拟赛12
    NOIP模拟赛11
  • 原文地址:https://www.cnblogs.com/zfyouxi/p/4822873.html
Copyright © 2011-2022 走看看