HDU 1505 City Game(01矩阵 dp)
2015-09-20 09:27
330 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
[align=left]Source[/align]
Southeastern Europe 2004
[align=left]Recommend[/align]
zl | We have carefully selected several similar problems for you: 1069 1176 1864 1003 2571
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
45 0
[align=left]Source[/align]
Southeastern Europe 2004
[align=left]Recommend[/align]
zl | We have carefully selected several similar problems for you: 1069 1176 1864 1003 2571
#include<iostream> #include<cstring> #include<algorithm> #include<cstdio> #include<queue> #include<stack> using namespace std; #define N 1005 int h ,le ,ri ; int n,m; int main() { int i,t,j; scanf("%d",&t); while(t--) { memset(h,0,sizeof(h)) ; scanf("%d%d",&n,&m); char c; int ans=0; for(i=1;i<=n;i++) for(j=1;j<=m;j++) { cin>>c; if(c=='F') h[i][j]=h[i-1][j]+1; else h[i][j]=0; } for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { le[j]=j; while(le[j]>1&&h[i][le[j]]<=h[i][le[j]-1]) le[j]=le[le[j]-1]; } for(j=m;j>=1;j--) { ri[j]=j; while(ri[j]<m&&h[i][ri[j]]<=h[i][ri[j]+1]) ri[j]=ri[ri[j]+1]; } for(j=1;j<=m;j++) ans=max(ans,h[i][j]*(ri[j]-le[j]+1)); } printf("%d\n",ans*3); } return 0; }
相关文章推荐
- html canvas 圆弧
- 输出正六边形
- hdu 5465 二维树状数组+nim博弈
- 2564:词组缩写
- 非静态内部类
- 2015年p2p网络借贷平台的发展现状
- Android Studio-emulator: ERROR: Unable to load VM from snapshot.
- HTTP POST,GET登陆代码演示
- 输出数组中出现次数最多的元素
- (2015秋) 团队博客及分组情况
- Android事件分发完全解析(下)
- Java中abstract和interface的区别
- JUnit4.8.2来源分析-2 org.junit.runner.Request
- JS /jquery 时间戳与日期转换
- 输出菱形
- 代码缩写与含义
- Fear
- 数据结构实践项目——栈
- 新书《Jfinal极速开发实战》正式发布
- Service的生命周期与Activity生命周期区别