POJ 2796 Feel Good (单调栈区间最大值)

最新推荐文章于 2023-01-05 12:23:36 发布

原创

最新推荐文章于 2023-01-05 12:23:36 发布 · 1.1k 阅读

1 ·

CC 4.0 BY-SA版权

本篇博客介绍如何利用单调栈解决POJ 2796题目的问题，即求给定数字序列中每个区间内的最大值。通过维护一个单调递减栈，对每个元素进行扩展，判断是否入栈、更新区间或计算值。文章通过举例详细解释了单调栈的工作原理和在处理区间最大值问题中的应用。

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 p