hdu 1505 City Game 1506的二维

最新推荐文章于 2021-07-13 22:54:02 发布

原创最新推荐文章于 2021-07-13 22:54:02 发布 · 497 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#City Game

动态规划专栏收录该内容

67 篇文章

订阅专栏

本文介绍了一个城市建造游戏中的算法挑战，玩家需要在限定区域内建造尽可能大的矩形建筑以获得租金收益，同时避免覆盖已存在的设施。文章提供了输入输出示例及优化后的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

City Game

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

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<algorithm>  
using namespace std;    
int l[1005][1005],r[1005][1005];   
int MAX,h[1005][1005];  
int main()    
{  
	int m,n,test;cin>>test;  
	while(test--)  
	{ 
		cin>>m>>n;
		int i,j;
		char ch;
		//memset(h,0,sizeof(h));
		for(i=1;i<=m;++i)
		{
			for(j=1;j<=n;++j)
			{
				cin>>ch;
				if(ch=='F')
					h[i][j]=h[i-1][j]+1;
				else
					h[i][j]=0;
			}
		}
			for(i=1;i<=m;++i)
			{
				l[i][1]=1;
				r[i][n]=n;
			}
			for(int x=1;x<=m;++x)
			{
				for(i=2;i<=n;++i)  
				{  
					int t=i;  
					while(t>1&&h[x][i]<=h[x][t-1])  
						t=l[x][t-1];  
					l[x][i]=t;  
				} 
			}
			for(int x=1;x<=m;++x)
			{
				for(i=n-1;i>=1;--i)  
				{  
					int t=i;  
					while(t<n&&h[x][i]<=h[x][t+1])  
						t=r[x][t+1];  
					r[x][i]=t;  
				} 
			}
			MAX=0; 
			for(int x=1;x<=m;++x)
				for(i=1;i<=n;++i)  
					if((r[x][i]-l[x][i]+1)*h[x][i]>MAX)  
						MAX=(r[x][i]-l[x][i]+1)*h[x][i];  
			cout<<MAX*3<<endl;  
	}  
}

10688081	2014-05-06 15:50:02	Accepted	1505	125MS	4248K	950 B	C++	向往蓝天的鱼
10687948	2014-05-06 15:32:39	Accepted	1505	140MS	12120K	1085 B	C++	向往蓝天的鱼

优化后内存明显减少

#include<iostream>    
#include<cstring>    
#include<algorithm>  
using namespace std;    
int l[1005],r[1005];   
int MAX,h[1005][1005];  
int main()    
{  
	int m,n,test;cin>>test;  
	while(test--)  
	{ 
		cin>>m>>n;
		int i,j;
		char ch;
		//memset(h,0,sizeof(h));
		for(i=1;i<=m;++i)
		{
			for(j=1;j<=n;++j)
			{
				cin>>ch;
				if(ch=='F')
					h[i][j]=h[i-1][j]+1;
				else
					h[i][j]=0;
			}
		}


		int MAXANS=0;
		for(int x=1;x<=m;++x)
		{
			l[1]=1;
			r[n]=n;
			for(i=2;i<=n;++i)  
			{  
				int t=i;  
				while(t>1&&h[x][i]<=h[x][t-1])  
					t=l[t-1];  
				l[i]=t;  
			} 

			for(i=n-1;i>=1;--i)  
			{  
				int t=i;  
				while(t<n&&h[x][i]<=h[x][t+1])  
					t=r[t+1];  
				r[i]=t;  
			} 

			MAX=0; 
			for(i=1;i<=n;++i)  
				if((r[i]-l[i]+1)*h[x][i]>MAX)  
					MAX=(r[i]-l[i]+1)*h[x][i]; 
			if(MAX>MAXANS)
				MAXANS=MAX;
		}
		cout<<MAXANS*3<<endl;  
	}  
}