poj2796 单调栈

题目链接:

http://poj.org/problem?id=2796

题意:

给你一个序列，让你求出一段区间，（在这段区间之内的最小值*这段区间所有元素之和）的最大值……

题解:

http://www.cnblogs.com/ziyi–caolu/archive/2013/06/23/3151556.html

代码:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 1e5+10;

struct node{
    ll num,pre,nxt;
    ll pos;
};

ll a[maxn], sum[maxn];

int main(){
    int n;
    while(scanf("%d",&n)==1){
        stack<node> s;
        sum[0] = 0;
        for(int i=1; i<=n; i++){
            a[i] = read();
            sum[i] = sum[i-1]+a[i];
        }
        node k;
        k.num = a[1]; k.pre = k.nxt = 1; k.pos = 1;
        s.push(k);
        ll ans = -1,x,y;
        for(int i=2; i<=n; i++){
            node t;
            t.num = a[i]; t.pre = t.nxt = 1; t.pos = i;
            while(!s.empty() && t.num<=s.top().num){
                node tt = s.top();
                s.pop();
                if(!s.empty())
                    s.top().nxt += tt.nxt;
                t.pre += tt.pre;
                ll tmp = tt.num*(sum[tt.pos+tt.nxt-1]-sum[tt.pos-tt.pre]);
                // cout << tt.pos << " " << tt.pre << " " << tt.nxt << " " << tmp << endl;
                if(ans < tmp){
                    ans = tmp;
                    x = tt.pos-tt.pre+1;
                    y = tt.pos+tt.nxt-1;
                }
            }
            s.push(t);
        }

        while(!s.empty()){
            node tt = s.top();
            s.pop();
            if(!s.empty())
                s.top().nxt += tt.nxt;

            ll tmp = tt.num*(sum[tt.pos+tt.nxt-1]-sum[tt.pos-tt.pre]);
            if(ans < tmp){
                ans = tmp;
                x = tt.pos-tt.pre+1;
                y = tt.pos+tt.nxt-1;
            }
        }

        cout << ans << endl << x << " " << y << endl;
    }

    return 0;
}
// http://www.cnblogs.com/ziyi--caolu/archive/2013/06/23/3151556.html