HDU 1506 & 1505 - Largest Rectangle in a Histogram & City Game
Largest Rectangle in a Histogram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17635 Accepted Submission(s): 5261
rectangles with the heights 2, 1, 4, 5, 1, 3, 3, measured in units where 1 is the width of the rectangles:
Usually, histograms are used to represent discrete distributions, e.g., the frequencies of characters in texts. Note that the order of the rectangles, i.e., their heights, is important. Calculate the area of the largest rectangle in a histogram that is aligned
at the common base line, too. The figure on the right shows the largest aligned rectangle for the depicted histogram.
Input
The input contains several test cases. Each test case describes a histogram and starts with an integer n, denoting the number of rectangles it is composed of. You may assume that 1 <= n <= 100000. Then follow n integers h1, ..., hn, where 0 <=
hi <= 1000000000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is 1. A zero follows the input for the last test case.
Output
For each test case output on a single line the area of the largest rectangle in the specified histogram. Remember that this rectangle must be aligned at the common base line.
Sample Input
7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0
Sample Output
8
4000
对于a[i],我们需要记录的是他之前和之后最大的连续的值比a[i]大的长度,如果每次都一个个去比对,数据大小是100000,时间复杂度是O(n^2),超时那是必然的。但是其实对于a[i]来说,如果去求后面连续的值,完全没必要一个个去比对,直接看a[i-1]的值就行了。 比如说2、3、4、5这个序列,如果我们要看3往后能延伸多长,并不需要去逐个和4和5比较,在计算4的时候,我们已经计算过5是比4大的,因为3比4小,4所能往后延伸的长度,3也一定能达到(4能延伸的长度内的数据都大于等于4,当然也都比3大),我们可以直接比较在4达到的最终长度的末端之后的值。 这道题计算的时候进制转换也需要特别注意,如果temp没有强制转换成__int64位,提交会wa。 这道题优化的思路非常巧妙,很值得学习。
参照这个思路,用dp求h[i]的左右边界,
先初始化h[i]的left[i]和right[i]都是i
对于第i个数h[i],假设它右边的所有数字的right[]都已经得到,那么比较h[i]和h[ right[i]+1 ]的大小,如果h[i] <= h[ right[i]+1 ],那么把right[i]变成right[i]+1的高度,再循环前面的步骤即可,直到right[i]+1到达整个h数组的边界即停止。
类似的可得到left[i]。
#include<cstdio>
int main()
{
int n,h[],left[],right[];
while(){
scanf("%d",&n);
if(n<=) break;
for(int i=;i<=n;i++){
scanf("%d",&h[i]);
right[i]=left[i]=i;
}
for(int i=n-;i>=;i--){
while(right[i]+<=n && h[i]<=h[right[i]+]) right[i]=right[right[i]+];
}
for(int i=;i<=n;i++){
while(left[i]->= && h[i]<=h[left[i]-]) left[i]=left[left[i]-];
}
unsigned long long ans=;
for(int i=;i<=n;i++)
{
unsigned long long temp=(unsigned long long)(right[i]-left[i]+) * h[i];
if(temp>ans) ans=temp;
}
printf("%llu\n",ans);
}
return ;
}
City Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6835 Accepted Submission(s): 2956
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.
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.
0
上面一题的进阶版,懒了……不想写思路了……
#include<cstdio>
#include<iostream>
using namespace std;
int deep[][];
int l[][];
int r[][];
int main()
{
int t;
scanf("%d",&t);
while(t--){
int m,n;char temp;
scanf("%d%d",&m,&n);
for(int j=;j<=n;j++) deep[][j]=;
for(int i=;i<=m;i++){
for(int j=;j<=n;j++){ cin>>temp;
if(temp=='F')
{
deep[i][j]=deep[i-][j]+;
}
else if(temp=='R')
{
deep[i][j]=;
} l[i][j]=j;r[i][j]=j;
}
} for(int i=;i<=m;i++){
for(int j=n-;j>=;j--){
while( r[i][j]+<=n && deep[i][j]<=deep[i][ (r[i][j]+) ] ) r[i][j]=r[i][ (r[i][j]+) ];
}
for(int j=;j<=n;j++){
while( l[i][j]->= && deep[i][j]<=deep[i][ (l[i][j]-) ] ) l[i][j]=l[i][ (l[i][j]-) ];
}
} int ans=;
for(int i=;i<=m;i++){
for(int j=;j<=n;j++){
int temp=deep[i][j]*(r[i][j]-l[i][j]+);
if(ans<temp) ans=temp;
}
}
printf("%d\n",ans*);
}
}
HDU 1506 & 1505 - Largest Rectangle in a Histogram & City Game的更多相关文章
- HDU 1505 Largest Rectangle in a Histogram && HDU 1506 City Game(动态规划)
1506意甲冠军:给你一个连续的直方图(拼贴底部长度1).求连续基质区. 对每一个直方图,分别向左向右进行扩展. #include<cstdio> #include<stdlib.h ...
- HDU——T 1506 Largest Rectangle in a Histogram|| POJ——T 2559 Largest Rectangle in a Histogram
http://acm.hdu.edu.cn/showproblem.php?pid=1506 || http://poj.org/problem?id=2559 Time Limit: 2000/1 ...
- HDU 1506 Largest Rectangle in a Histogram (dp左右处理边界的矩形问题)
E - Largest Rectangle in a Histogram Time Limit:1000MS Memory Limit:32768KB 64bit IO Format: ...
- HDU 1506 Largest Rectangle in a Histogram set+二分
Largest Rectangle in a Histogram Problem Description: A histogram is a polygon composed of a sequenc ...
- hdu 1506 Largest Rectangle in a Histogram 构造
题目链接:HDU - 1506 A histogram is a polygon composed of a sequence of rectangles aligned at a common ba ...
- HDU 1506 Largest Rectangle in a Histogram(区间DP)
题目网址:http://acm.hdu.edu.cn/showproblem.php?pid=1506 题目: Largest Rectangle in a Histogram Time Limit: ...
- Day8 - C - Largest Rectangle in a Histogram HDU - 1506
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rec ...
- DP专题训练之HDU 1506 Largest Rectangle in a Histogram
Description A histogram is a polygon composed of a sequence of rectangles aligned at a common base l ...
- Hdu 1506 Largest Rectangle in a Histogram 分类: Brush Mode 2014-10-28 19:16 93人阅读 评论(0) 收藏
Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 ...
随机推荐
- CPP Note
hello.cpp -> 编译代码g++ hello.cpp -o a -> a.out 区分大小写的编程语言 内置类型 一些基本类型可以使用一个或多个类型修饰符进行修饰: signed: ...
- webpack 使用别名(resolve.alias)解决scss @import相对路径导致的问题
webpack.conf.js 中 resolve.alias 配置 resolve: { extensions: ['.js', '.vue'], alias: { '@': path.resolv ...
- [k8s]zookeeper集群在k8s的搭建(statefulset模式)-pod的调度
之前一直docker-compose跑zk集群,现在把它挪到k8s集群里. docker-compose跑zk集群 zk集群in k8s部署 参考: https://github.com/kubern ...
- JPA+Hibernate 3.3 ——第一个JPA程序
所需要的最小的jar包(注意:jar包所在路径不能含有空格或中文) hibernate3.jarhibernate-cglib-repack-2.1_3.jarslf4j-api-1.5.2.jarj ...
- python prettytable模块
简介 Python通过PrettyTable模块可以将输出内容如表格方式整齐地输出. 安装 pip install prettytable 1 示例 from prettytable import P ...
- netbeans增加yii的代码提示
在NetBeans中创建PHP项目 NetBeans目前还没有直接支持Yii Framework或Yii相关的插件,但是可以通过其他方式来实现Yii的代码自动提示. 首先,打开新建项目向导,创建一个“ ...
- spring aop 之xml
1.类库 2.aop概念 一个切面可以有多个切点 3.在方法前后进行aop的测试代码 3.1aop.xml <beans xmlns="http://www.springframewo ...
- CMake结合PCL库学习(3)
CMake常用指令结合PCL 的顶层CMake文件的解释 基本指令 (1)ADD_DEFINITIONS 向 C/C++编译器添加-D 定义,比如:ADD_DEFINITIONS(-DENABLE_D ...
- Java知多少(76)语言包(java.lang)简介
Java语言包(java.lang)定义了Java中的大多数基本类,由Java语言自动调用,不需要显示声明.该包中包含了Object类,Object类是整个类层次结构的根结点,同时还定义了基本数据类型 ...
- Fedora 21 安装 Budgie Desktop
最新文章:Virson's Blog Budgie Desktop 是一款自由开源桌面,是 Evolve OS 的默认桌面,Evolve OS 是一款 OpenSUSE 的衍生系统.Budgie De ...