SEERC 2004 / UVa 1330 City Game (扫描)
来源:互联网 发布:淘宝模特如何找到商家 编辑:程序博客网 时间:2024/05/18 15:08
1330 - City Game
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460&page=show_problem&problem=4076
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 file 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 unitIn the end of each area description there is a separating line.
F : free unit
Output
For each data set in the input file 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
此题是POJ 2559 / HDU 1506 Largest Rectangle in a Histogram的二维扩展。
思路请参考这篇。
完整代码:
/*0.072s*/#include<cstdio>#include<algorithm>using namespace std;const int maxn = 1000;int mat[maxn][maxn], up[maxn][maxn], left[maxn][maxn], right[maxn][maxn];int main(){int T;scanf("%d", &T);while (T--){int m, n;scanf("%d%d", &m, &n);for (int i = 0; i < m; i++)for (int j = 0; j < n; j++){int ch = getchar();while (ch != 'F' && ch != 'R') ch = getchar();mat[i][j] = ch == 'F' ? 0 : 1;}int ans = 0;for (int i = 0; i < m; i++) // 从上到下逐行处理{int lo = -1, ro = n;for (int j = 0; j < n; j++) // 从左到右扫描,维护up和leftif (mat[i][j]){up[i][j] = left[i][j] = 0;lo = j;}else{up[i][j] = (i == 0 ? 1 : up[i - 1][j] + 1);left[i][j] = (i == 0 ? lo + 1 : max(left[i - 1][j], lo + 1));}for (int j = n - 1; j >= 0; j--) // 从右到左扫描,维护right并更新答案if (mat[i][j]){right[i][j] = n;ro = j;}else{right[i][j] = (i == 0 ? ro - 1 : min(right[i - 1][j], ro - 1));ans = max(ans, up[i][j] * (right[i][j] - left[i][j] + 1));}}printf("%d\n", ans * 3);}return 0;}
- SEERC 2004 / UVa 1330 City Game (扫描)
- UVA 1330 LA 3029 seerc 2004 - City Game
- uva 1330 - City Game(扫描法)
- 最大子矩阵,City Game,SEERC 2004,LA3029
- UVaLive(LA) 3029 City Game,SEERC 2004题解
- UVA 1330 - City Game(扫描方法 | 单调栈维护)
- uva 1330 - City Game
- uva 1330 City Game
- UVa:1330 City Game
- UVA 1330 - City Game
- UVa 1330 - City Game
- UVA - 1330 City Game
- uva 1330 - City Game 模拟
- uva 1330 - City Game(dp)
- UVA之1330 - City Game
- City Game(扫描线)
- UVa 1330 - City Game 最大子矩阵
- uva 1330City Game (最大子矩阵)
- 关于Extjs中的按钮的handler
- HTTP基本认证(HTTP Basic Athorization)过程分析
- PB调用C#编写的DLL
- linux 如何显示一个文件的某几行(中间几行)
- View Controller 生命周期的各个方法的用法
- SEERC 2004 / UVa 1330 City Game (扫描)
- 计数排序
- yii验证和授权
- myeclipse 8.6 提速
- android:Broadcast&BroadcastReceiver
- Oracle笔记(四) 简单查询、限定查询、数据的排序
- (整理)数值范围
- A. Levko and Table
- ORACLE directory 目录 (键人岐)