A - City Game
来源:互联网 发布:怎样制作淘宝图文详情 编辑:程序博客网 时间:2024/04/28 08:27
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
R reserved unitIn the end of each area description there is a separating line.
F free unit
Output
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
这道题目的意思:F代表可利用,R代表不可利用的,求出最大矩形的面积,打印3倍就行,但是怎么找到最大矩形这是个问题,而且要用二维数组存储,R标记0,F标记1,然后横向++,矩阵如下:
示例一: 示例二:全是0
0 1 2 3 4 5
1 2 3 4 5 6
0 0 0 1 2 3
1 2 3 4 5 6
1 2 3 4 5 6
此题是少鹏给我讲的,33秒过得,用时最短的,算法思想就是扫描线,逐行扫描,不错。代码如下:
#include <stdio.h>#include <string.h>int map[1001][1001];int main(){int t;scanf("%d", &t );int i, j, k; int n, m; char ch;while(t--) {scanf("%d %d%*c", &n, &m );memset(map, 0, sizeof(0)); //每次都得初始化for(i=1; i<=n; i++){for(j=1; j<=m; j++){ch=getchar();while(ch!='F' && ch!='R' ){ch=getchar();}if(ch=='F'){map[i][j] = map[i][j-1] + 1;}else{map[i][j] = 0;}}} //map的创建,注意对字符与空格的处理,然后转化为数字存进map //存数方式要注意int min; int area=0; //初始面积为0int high; //定义高度////////////////////////////////////////////for(i=1; i<=n; i++){for(j=1; j<=m; j++){if(map[i][j]!=0) //访问的数据>0 : (F){min=map[i][j] ;if( area < map[i][j] ){area = map[i][j] ;}high =1; //初始高度自身for(k=i-1; k>=1; k--){if(map[k][j]==0 )break;else{high++; //高度增加if(map[k][j] < min ){min = map[k][j] ;}if(area < high*min ){area = high*min;}}}}}}printf("%d\n", area*3 );}return 0;}
- A - City Game
- City Game
- City Game
- City Game
- City Game
- City Game
- City Game
- City Game
- City Game
- poj2559 Largest Rectangle in a Histogram hdu1505 City Game
- poj 1964 City Game
- HDU 1505 City Game
- hdu 1505 City Game
- POJ 1964 City Game
- 【DP】 hdu1505 City Game
- HDU1505/POJ1964 City Game
- hdu 1505 city game
- POJ-1964-City Game
- 回文数算法
- bzoj1112 [POI2008]砖块Klo
- candy 重
- Linux 学习规划
- maven中findbugs-maven-plugin插件与cobertura-maven-plugin的使用
- A - City Game
- SQLite
- 【索引】Probability
- KMP模版题--》水水更自信
- Android开发之SoundPool使用详解
- 水电工电饭锅电饭锅
- 回文串算法
- 【索引】Probability::Examples
- python 正则匹配文本并返回字典列表