zoukankan      html  css  js  c++  java
  • HDU 1505 City Game(DP)

    City Game

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


    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


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

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



  • 相关阅读:
    android ImageSwitcher
    andriod Spinner
    andriod RadioButton
    anriod TabHost
    给大学生的几条良心建议
    6月最新地铁站周边二手房价格出炉
    机器学习 101 Mahout 简介 建立一个推荐引擎 使用 Mahout 实现集群 使用 Mahout 实现内容分类 结束语 下载资源
    Vim设置colorscheme小技巧
    2017年阳光私募基金一季度报告
    实用的 atom 插件
  • 原文地址:https://www.cnblogs.com/jzssuanfa/p/7216267.html
Copyright © 2011-2022 走看看