HDU 1505 City Game 【扫描线】
来源:互联网 发布:qq认证群排名优化 编辑:程序博客网 时间:2024/04/28 00:55
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.
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.
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
25 6R F F F F FF F F F F FR R R F F FF F F F F FF F F F F F5 5R R R R RR R R R RR R R R RR R R R RR R R R R
Sample Output
450
给定一个m*n的矩阵,其中一些格子是空地(F),其它是障碍(R)。找出一些由F组成的面积最大的子矩阵, 输出其面积乘以3后的结果。
本题运用递归,扫描思想,时间复杂度为O(mn);
#include <stdio.h>#include <iostream>#include <algorithm>using namespace std;const int maxn = 1000;int mat[1000][1000];int up[1000][1000];int l[1000][1000],r[1000][1000];int main(){ int T,i,j; scanf("%d", &T); while(T--) { int n,m; char str[10]; scanf("%d %d", &m, &n); for(i=0;i<m;i++) for(j=0;j<n;j++) { scanf("%s", str); if(str[0]=='F') mat[i][j] = 0; else mat[i][j] = 1; } int ans = 0; for(i=0;i<m;i++) { int l1 = -1, r1 = n; for(j=0;j<n;j++) { if(mat[i][j]==1) { up[i][j] = l[i][j] = 0; l1 = j; } else { up[i][j] = i==0?1:up[i-1][j]+1; l[i][j] = i==0?l1+1:max(l[i-1][j],l1+1); } } for(j = n-1;j>=0;j--) if(mat[i][j]==1) { r[i][j] = n; r1 = j; } else { r[i][j] = i==0?r1-1:min(r[i-1][j], r1-1); ans = max(ans,up[i][j]*(r[i][j]-l[i][j]+1)); } } printf("%d\n", ans*3); } return 0;}
0 0
- HDU 1505 City Game 【扫描线】
- City Game(扫描线)
- HDU 1505 & POJ 1964 City Game (递推+扫描法)
- HDU 1505 City Game
- hdu 1505 City Game
- hdu 1505 city game
- HDU 1505 City Game
- hdu 1505 City Game
- hdu 1505 City Game
- HDU 1505 City Game
- HDU 1505 City Game
- hdu 1505 City Game
- HDU - 1505 City Game
- HDU-1505-City Game
- HDU 1505 City Game
- HDU 1505 City Game
- HDU 1505 City Game
- HDU 1505 City Game
- 取余运算
- Tomcat部署复制项目新项目名字已改,但部署时名字还是旧项目名
- zoj 2587 Unique Attack (判断最小割是否唯一)
- android 打开系统程序 显示系统图片与视频(用于备忘)
- iOS上的http请求:get、post以及同步、异步
- HDU 1505 City Game 【扫描线】
- ActionBar按钮动画的实现
- HLS流媒体--ios现场直播的实现
- 程序员生存定律--成长路上常见的坑
- HDU 4599 Dice
- having在Oracle和mysql中的一点不同点
- hadoop2.4环境搭建
- 浅谈字体渲染
- hdu-2544-最短路