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

    Largest Rectangle in a Histogram

    Largest Rectangle in a Histogram
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 21708   Accepted: 7003

    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
    

    Hint

    Huge input, scanf is recommended.

    Source

    继续单调栈啦,当然是可以优化的,运行时间和别人差别好大啊
    #include <stdio.h>
    #include <string.h>
    typedef long long LL;
    const int maxn=1e5+5;
    LL a[maxn];
    int s[maxn];
    int L[maxn];
    int R[maxn];
    int main() {
        int n;
        while(scanf("%d",&n),n) {
            memset(s, 0, sizeof(s));
            for (int i = 1; i <= n; i++) {
                scanf("%lld", &a[i]);
            }
            int top = 0;
            a[0] = -1;
            for (int i = 1; i <= n; i++) {
                while (top && a[i] <= a[s[top]]) {
                    top--;
                }
                L[i] = s[top];
                s[++top] = i;
            }
            top = 0;
            s[top++] = n + 1;
            a[n + 1] = -1;
            for (int i = n + 1; i >= 1; i--) {
                while (top && a[i] <= a[s[top]]) {
                    top--;
                }
                R[i] = s[top];
                s[++top] = i;
            }
            LL ans = 0;
            for (int i = 1; i <= n; i++) {
                LL t = (R[i] - L[i] - 1) * a[i];
                if (ans < t)
                    ans = t;
            }
            printf("%lld
    ", ans);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    Maven 梳理
    Maven 梳理
    Maven 梳理-自动创建Maven项目(非web)
    Maven 梳理-手动创建Maven项目(非web),使用Maven编译、测试、打包、安装、引用
    Maven 梳理 -目录结构
    Maven 梳理-安装配置
    Spring 梳理-数据访问-DB
    JNDI数据源的配置
    Spring 梳理-JdbcTemplate简介
    Docker常用命令
  • 原文地址:https://www.cnblogs.com/BobHuang/p/6835269.html
Copyright © 2011-2022 走看看