程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> 關於C++ >> poj2559 Largest Rectangle in a Histogram

poj2559 Largest Rectangle in a Histogram

編輯:關於C++

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
#include
#include
#include
#include
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(ans0){
				stack[top].count+=count;
				count=stack[top].count;
				sum1=count*stack[top].h;
				if(ans

 

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved