zoukankan      html  css  js  c++  java
  • POJ2796(单调栈)

    Feel Good

    Time Limit: 3000MS   Memory Limit: 65536K
    Total Submissions: 12987   Accepted: 3639
    Case Time Limit: 1000MS   Special Judge

    Description

    Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people's memories about some period of life. 

    A new idea Bill has recently developed assigns a non-negative integer value to each day of human life. 

    Bill calls this value the emotional value of the day. The greater the emotional value is, the better the daywas. Bill suggests that the value of some period of human life is proportional to the sum of the emotional values of the days in the given period, multiplied by the smallest emotional value of the day in it. This schema reflects that good on average period can be greatly spoiled by one very bad day. 

    Now Bill is planning to investigate his own life and find the period of his life that had the greatest value. Help him to do so.

    Input

    The first line of the input contains n - the number of days of Bill's life he is planning to investigate(1 <= n <= 100 000). The rest of the file contains n integer numbers a1, a2, ... an ranging from 0 to 106 - the emotional values of the days. Numbers are separated by spaces and/or line breaks.

    Output

    Print the greatest value of some period of Bill's life in the first line. And on the second line print two numbers l and r such that the period from l-th to r-th day of Bill's life(inclusive) has the greatest possible value. If there are multiple periods with the greatest possible value,then print any one of them.

    Sample Input

    6
    3 1 6 4 5 2
    

    Sample Output

    60
    3 5

    单调栈的精髓还得好好领会。
     1 //2016.8.23
     2 #include<iostream>
     3 #include<cstdio>
     4 #define ll __int64
     5 
     6 using namespace std;
     7 
     8 const int N = 100005;
     9 ll sum[N], ans, tmp;
    10 int Stack[N], a[N], l[N], L, R;
    11 
    12 int main()
    13 {
    14     int n, top;
    15     while(scanf("%d", &n)!=EOF)
    16     {
    17         sum[0] = ans = top = 0;
    18         for(int i = 1; i <= n; i++)
    19         {
    20             scanf("%d", &a[i]);
    21             sum[i] = sum[i-1]+a[i];
    22         }
    23         a[++n] = -1;
    24         ans = -1;
    25         for(int i = 1; i <= n; i++)
    26         {
    27             if(top == 0 || a[i]>a[Stack[top-1]])
    28             {
    29                 Stack[top++] = i;
    30                 l[i] = i;
    31                 continue;
    32             }
    33             if(a[i] == a[Stack[top-1]])continue;
    34             while(top>0 && a[i]<a[Stack[top-1]])
    35             {
    36                 top--;
    37                 tmp = 1ll*a[Stack[top]]*(sum[i-1]-sum[l[Stack[top]]-1]);
    38                 if(tmp > ans)
    39                 {
    40                     ans = tmp;
    41                     L = l[Stack[top]];
    42                     R = i-1;
    43                 }
    44             }
    45 
    46             l[i] = l[Stack[top]];
    47             Stack[top++] = i;
    48         }
    49 
    50         printf("%I64d
    %d %d
    ", ans, L, R);
    51     }
    52 
    53     return 0;
    54 }
  • 相关阅读:
    delphi point数据类型
    Sql Server 2008 R2链接服务器Oracle数据库
    ORA-28000 账号被锁定的解决办法
    [Oracle] sqlplus / as sysdba ora-01031 insufficient privileges
    Oracle的操作系统认证(/ as sydba 登录方式)
    Delphi使用线程TThread查询数据库
    oracle
    统计字符串中字符出现的次数-Python
    Jmeter保存下载的文件
    如何在Microsoft Store上免费获得 HEIF、HEVC 编码支持
  • 原文地址:https://www.cnblogs.com/Penn000/p/5801140.html
Copyright © 2011-2022 走看看