zoukankan      html  css  js  c++  java
  • poj2559 Largest Rectangle in a Histogram

    Description

    A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows the histogram that consists of 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

    这题之前是用dp做的,现在用单调栈做了一下。

    #include<iostream>
    #include<stdio.h>
    #include<stdlib.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    #define ll long long
    #define maxn 100500
    struct node{
    	ll count,h;
    }stack[maxn];
    int main()
    {
    	int n,m,i,j;
    	ll ans,sum1,top,count,tmp,a;
    	while(scanf("%d",&n)!=EOF && n!=0)
    	{
    		top=0;ans=0;
    		for(i=1;i<=n;i++){
    			scanf("%lld",&a);
    			count=0;
    			while(top>0 && stack[top].h>=a){
    				stack[top].count+=count;
    				count=stack[top].count;
    				sum1=count*stack[top].h;
    				if(ans<sum1)ans=sum1;
    				top--;
    			}
    			top++;
    			stack[top].h=a;
    			stack[top].count=count+1;
    		}
    		count=0;
    		while(top>0){
    				stack[top].count+=count;
    				count=stack[top].count;
    				sum1=count*stack[top].h;
    				if(ans<sum1)ans=sum1;
    				top--;
    	    }
    	    printf("%lld
    ",ans);
    	}
    	return 0;
    }


  • 相关阅读:
    JavaScript 基本类型值-Undefined、Null、Boolean
    Git学习之路(6)- 分支操作
    Git学习之路(5)- 同步到远程仓库及多人协作问题
    setTimeout小总结
    Git学习之路(4)- 撤销操作、删除文件和恢复文件
    Git学习之路(3)-提交文件到三个区
    Git学习之路(2)-安装GIt和创建版本库
    Git学习之路(1)-Git简介
    两种常见挂载Jenkins slave节点的方法
    rabbitmq集群节点操作
  • 原文地址:https://www.cnblogs.com/herumw/p/9464714.html
Copyright © 2011-2022 走看看