hdu 1505 City Game 简单DP 最大子矩阵 迭代法
来源:互联网 发布:阿里巴巴怎么上传淘宝 编辑:程序博客网 时间:2024/05/21 06:52
hdu 1506 加强版 题解:点我
只不过在1506的基础上套了一重循环。
City Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6059 Accepted Submission(s): 2591
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
Source
Southeastern Europe 2004
#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<cmath>#include<algorithm>using namespace std;typedef long long ll;const int INF =0x3f3f3f3f;const int maxn=1000 ;const int maxm=1000 ;char ch[maxn+5][maxm+5];int a[maxn+5][maxm+5];int L[maxm+5],R[maxm+5];int n,m;int main(){ int T; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); int ans=0; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { scanf(" %c",&ch[i][j]); a[i][j]= ch[i][j]=='F'?1:0; if(a[i][j]) a[i][j]+=a[i-1][j]; } } for(int i=1;i<=n;i++) { L[1]=1; for(int j=2;j<=m;j++) { int p=j; while(p-1>=1&&a[i][p-1]>=a[i][j]) p=L[p-1]; L[j]=p; } R[m]=m; for(int j=m-1;j>=1;j--) { int p=j; while(p+1<=m&&a[i][p+1]>=a[i][j]) p=R[p+1]; R[j]=p; } for(int j=1;j<=m;j++) { ans=max(ans, a[i][j]*(R[j]-L[j]+1) ); } } printf("%d\n",3*ans); } return 0;}
0 0
- hdu 1505 City Game 简单DP 最大子矩阵 迭代法
- HDU 1505 City Game-dp-(最大子矩阵模型)
- hdu 1506 求最大子矩阵 简单DP 迭代法
- HDU 1505 City Game(DP求二维最大子矩阵)
- hdu 1505 City Game(最大子矩阵)
- HDU 1505 City Game (单调栈+最大子矩阵面积)
- UVALive 3029 City Game 悬线法求最大子矩阵面积 dp
- hdu 1505 City Game(0和1 中的最大子矩阵)
- POJ 1964&HDU 1505&HOJ 1644 City Game(最大0,1子矩阵和总结)
- 暑期dp46道(9)——HDU 1505City Game 求最大子矩阵面积
- POJ1964 City Game(最大子矩阵)
- UVa 1330 - City Game 最大子矩阵
- poj1964 City Game(最大子矩阵)
- uva 1330City Game (最大子矩阵)
- hdu1505 City Game (最大子矩阵)
- UVA 1330 City Game(最大子矩阵)
- City Game (最大子矩阵)
- hdu1505 City game(最大子矩阵)
- HDU 1241 Oil Deposits (搜索水题)
- C语言笔记
- Swift-Array数组操作
- 优化SQL查询:如何写出高性能SQL语句
- TortoiseGit上传代码到GitHub
- hdu 1505 City Game 简单DP 最大子矩阵 迭代法
- Android开发请求网络方式详解
- leetcode 5. Longest Palindromic Substring
- Linux笔记(18)——磁盘管理基本命令
- activiti学习笔记
- Kobe
- VS中使用marquee文本超链接时url路径转http路径的一个方法
- 时间复杂度
- tomcat连接器