zoukankan      html  css  js  c++  java
  • hdu 1505

    City Game

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


    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
     

     乱搞,估计数据比较水

    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <cstdlib>
    #include <cmath>
    #include <string>
    #include <vector>
    #include <list>
    #include <map>
    #include <queue>
    #include <stack>
    #include <bitset>
    #include <algorithm>
    #include <numeric>
    #include <functional>
    using namespace std;
    #define LL long long
    #define DB double
    #define N 1005
    #define esp 1e-6
    const int INF = 0x3f3f3f3f;
    const LL INFF = 1LL << 60;
    const DB EPS = 1e-9;
    const DB OO = 1e15;
    const DB PI = acos(-1.0);
    char ma[N][N];
    int dp[N][N],r[N],dp1[N][N];
    int main()
    {
        int i,j,k,t,n,m;
        scanf("%d",&t);
        while(t--)
        {
            memset(ma,0,sizeof(ma));
            scanf("%d %d",&n,&m);
            for(i = 1; i <= n ; i++)
            {
                for(j = 1 ; j <= m ; j++)
                {
                    cin>>ma[i][j];
                }
            }
            memset(dp,0,sizeof(dp));
            for(i = 1 ; i <= n ; i++)
            {
                for(j = 1 ; j <= m ; j++) r[j] = j+1;
                for(j = m ; j >=1 ; j--){
                    if(ma[i][j]=='F')
                    {
                        int cur = r[j];
                        while(ma[i][cur]=='F') cur = r[cur];
                        dp[i][j] = cur-j;
                    }
                }
            }
            int ans = 0;
            memset(dp1,0,sizeof(dp1));
            for(j = 1 ; j <=m ; j++)
            {
                for(i= 1 ; i <= n ; i++) r[i] = i+1;
                for(i = n ; i>= 1; i--)  {
                    if(ma[i][j]=='F')
                    {
                        int cur = r[i];
                        while(ma[cur][j] =='F') cur = r[cur];
                        dp1[i][j] = cur - i;
                    }
                }
            }
            for(i = 1 ; i <= n ; i++)
            {
                for(j = 1 ; j <= m ; j++)
                {
                    if(dp[i][j]>0&&dp1[i][j]>0&&dp[i][j]*dp1[i][j]>ans)
                    {
                        int a = INF;
                        for(k = 0 ; k<dp[i][j] ; k++)
                            a = min(a,dp1[i][j+k]);
                        ans = max(ans,a*dp[i][j]);
                        a = INF;
                        for(k = 0 ; k <dp1[i][j] ; k++)
                            a = min(a,dp[i+k][j]);
                        ans = max(ans,a*dp1[i][j]);
                    }
                }
            }
            printf("%d
    ",ans*3);
        }
        return 0;
    }
  • 相关阅读:
    Python处理海量手机号码
    javascript面向对象
    NET实现的DDD、CQRS与微服务架构
    增加打赏功能
    开发测试时给 Kafka 发消息的 UI 发送器――Mikasa
    Computational Network Toolkit (CNTK) 是微软出品的开源深度学习工具包
    线程同步和多线程优先级
    linux sed命令详解(转)
    linux sort,uniq,cut,wc命令详解 (转)
    linux awk命令详解(转)
  • 原文地址:https://www.cnblogs.com/llei1573/p/3885947.html
Copyright © 2011-2022 走看看