zoukankan      html  css  js  c++  java
  • HDOJ 1505 City Game

    计算出对应的高度,一层一层的DP最大面积

    City Game

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


    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
     
     1 #include <iostream>
     2 #include <cstring>
     3 
     4 using namespace std;
     5 
     6 char a[1100][1100];
     7 int b[1100][1100];
     8 
     9 int l[1100],r[1100];
    10 
    11 int main()
    12 {
    13     int k;
    14     cin>>k;
    15     while(k--)
    16     {
    17         memset(a,'R',sizeof(a));
    18         memset(b,0,sizeof(b));
    19         int m,n;
    20         cin>>m>>n;
    21         for(int i=1;i<=m;i++)
    22             for(int j=1;j<=n;j++)
    23         {
    24             char c;  cin>>c;
    25             if(c=='R'||c=='F')
    26                 a[i][j]=c;
    27         }
    28 
    29         for(int j=1;j<=n;j++)
    30         {
    31             int high=1;
    32             for(int i=1;i<=m;i++)
    33             {
    34                 if(a[i][j]=='R') {high=1;}
    35                 else if(a[i][j]=='F')
    36                 {
    37                    b[i][j]=high;
    38                    high++;
    39                 }
    40             }
    41         }
    42 
    43         int ans=0;
    44         for(int i=1;i<=m;i++)
    45         {
    46 
    47             for(int k=1;k<=n;k++)
    48                 l[k]=r[k]=k;
    49 
    50             for(int j=n;j>=1;j--)
    51                while(b[i][r[j]+1]>=b[i][j]&&(r[j]+1)<=n)
    52                    r[j]=r[r[j]+1];
    53 
    54             for(int j=1;j<=n;j++)
    55                 while(b[i][l[j]-1]>=b[i][j]&&(l[j]-1)>0)
    56                    l[j]=l[l[j]-1];
    57 
    58             for(int j=1;j<=n;j++)
    59             ans=max(ans,b[i][j]*(r[j]-l[j]+1));
    60 
    61         }
    62 
    63         cout<<ans*3<<endl;
    64 
    65     }
    66     return 0;
    67 }
  • 相关阅读:
    服务器安全之修改3389远程桌面端口小工具(包源码)
    CYQ.Data.ProjectTool 项目配置工具发布(包源码)
    爱奇艺视频广告拦截失败,发文共商大计
    开发者基础知识游戏,共10关,欢迎挑战
    秋天新作品:秋式广告杀手,每年帮大伙多活78天!
    MySql Blob图片类型存储Bug解决:索引超出了数组界限错误
    爱奇艺视频广告拦截失败,发文共商大计
    简说宽带商的弹窗广告进化及网站应对之策(DNS劫持进化论)
    秋式广告杀手技术分享:网络请求基础知识
    通用社区登陆组件技术分享(开源)中篇:OAuth 登陆组件流程及组件集成方法
  • 原文地址:https://www.cnblogs.com/CKboss/p/3086177.html
Copyright © 2011-2022 走看看