zoukankan      html  css  js  c++  java
  • HDU1505

    City Game

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 5567    Accepted Submission(s): 2401


    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
     
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<cstring>
     4 #include<algorithm>
     5 #include<cstdlib>
     6 using namespace std;
     7 #define maxn 1000+5
     8 int dp[maxn][maxn];
     9 int l[maxn],r[maxn];
    10 int main()
    11 {
    12     int n,m,ans;
    13     char c[10];
    14     int t;
    15     scanf("%d",&t);
    16     while(t--)
    17     {
    18         scanf("%d%d",&n,&m);
    19         memset(dp,0,sizeof(dp));
    20         for(int i=1;i<=n;i++)
    21         {
    22             for(int j=1;j<=m;j++)
    23             {
    24                 scanf("%s",&c);
    25                 if(c[0]=='F')
    26                     dp[i][j]=dp[i-1][j]+1;
    27                 else
    28                     dp[i][j]=0;
    29             }
    30         }
    31 
    32             int ans=0;
    33             for(int i=1;i<=n;i++)
    34             {
    35                 l[1]=1;
    36                 r[m]=m;
    37                 dp[i][0]=-1;
    38                 dp[i][m+1]=-1;
    39                 for(int j=2;j<=m;j++)
    40                 {
    41                     l[j]=j;
    42                     while(dp[i][l[j]]<=dp[i][l[j]-1])
    43                         l[j]=l[j]-1;
    44                 }
    45                 for(int j=m-1;j>=1;j--)
    46                 {
    47                     r[j]=j;
    48                     while(dp[i][r[j]]<=dp[i][r[j]+1])
    49                         r[j]=r[j]+1;
    50                 }
    51                 for(int j=1;j<=m;j++)
    52                     ans=max(ans,(r[j]-l[j]+1)*dp[i][j]);
    53             }
    54         printf("%d
    ",ans*3);
    55     }
    56     return 0;
    57 }
  • 相关阅读:
    命令安装mongod作为服务启动
    npm命令
    win服务
    win进程操作
    【数据结构与算法之美】7.排序算法之冒泡、选择、插入
    【leetcode】23.合并K个排序链表
    【leetcode】141.环形链表
    【数据结构与算法之美】6.环形队列
    【数据结构与算法之美】5.基于链表实现队列
    【数据结构与算法之美】4.基于数组实现队列
  • 原文地址:https://www.cnblogs.com/ZP-Better/p/4690943.html
Copyright © 2011-2022 走看看