zoukankan      html  css  js  c++  java
  • hdu 1506

    Largest Rectangle in a Histogram

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


    Problem 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
     

     貌似 long long 过不了,要__int64才可以

    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    using namespace std;
    #define N 100005
    #define INF 0x3f3f3f3f
    #define LL __int64
    LL l[N],r[N],h[N];
    int main()
    {
        LL temp,n,i;
        while(~scanf("%I64d",&n),n)
        {
           for(i = 1 ; i <= n ; i++)
           {
               scanf("%I64d",&h[i]);
               l[i]=i-1;
               r[i]=i+1;
           }
           for(i = 1 ; i <= n ; i++)
           {
               temp = l[i];
               while(temp>0&&h[i]<=h[temp]){
                temp = l[temp];
               }
               l[i] = temp;
           }
           for(i = n ; i>=1 ; i--)
           {
               temp = r[i];
               while(temp<=n&&h[i]<=h[temp]){
                temp = r[temp];
               }
               r[i] = temp;
           }
           LL sum = 0;
           for(i = 1 ; i<= n ; i++)
               sum = max(sum,h[i]*(r[i]-l[i]-1));
           printf("%I64d
    ",sum);
        }
        return 0;
    }
  • 相关阅读:
    my read travel
    OS + CentOS 7 / centos 7 / config / configuration / rescue / rc.local / yum
    my soft / win soft
    如何撰写发明专利申请文件
    专利局审查员如何审专利
    国际专利分类表(2016版)
    手把手教你写专利申请书/如何申请专利
    Packets switched through Linux bridge have very high packet delay variation and latency?
    当心僵尸:过时Linux内核的安全风险
    飞漫魏永明:从MiniGUI看嵌入式十年得与失
  • 原文地址:https://www.cnblogs.com/llei1573/p/3853230.html
Copyright © 2011-2022 走看看