UVA1619 感觉不错 Feel Good(单调栈)

UVA1619 感觉不错 Feel Good

解题思路：对于每一个数利用单调栈计算出它左边和右边比它小的值的下标，利用前缀和计算这段区间的和。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef unsigned long long ull;
typedef pair<int,int>P;
const int inf = 0x7f7f7f7f;
const ll INF = 1e16;
const int N = 1e6+10;
const ull base = 131;
const ll mod =  1e9+7;


inline int read(){int 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;}
inline string readstring(){string str;char s=getchar();while(s==' '||s=='\n'||s=='\r'){s=getchar();}while(s!=' '&&s!='\n'&&s!='\r'){str+=s;s=getchar();}return str;}
int random(int n){return (int)(rand()*rand())%n;}
void writestring(string s){int n = s.size();for(int i = 0;i < n;i++){printf("%c",s[i]);}}
bool is_prime(int n){if(n <2) return false;for(int i = 2;i*i <= n;i++){if(n%i == 0) return false;}return true;}


ll a[N];
int r[N],l[N];
ll sum[N];



void solve(int n){
    memset(l,0,sizeof l);
    memset(r,0,sizeof r);
    stack<int>st;
    for(int i = 1;i <= n+1;i++){
        while(st.size()&&a[i]<a[st.top()]){
            r[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
    while(st.size()) st.pop();
    for(int i = n;i >= 1;i--){
        while(st.size()&&a[i]<a[st.top()]){
            l[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
    ll ans = 0;
    int L = 1,R =1;
    for(int i = 1;i <= n;i++){
        int x = r[i]-1;
        int y = l[i]+1;

        if(a[i]*(sum[x]-sum[y-1])>ans){
            ans = a[i]*(sum[x]-sum[y-1]);
            L = y;
            R = x;
        }else if(a[i]*(sum[x]-sum[y-1])==ans){
            if(x-y < R-L){
                L = y;
                R = x;
            }else if(x-y==R-L&&y+1<L){
                L = y;
                R = x;
            }
        }
    }
    printf("%lld\n",ans);
    printf("%d %d\n",L,R);
}
int main(){
    //freopen("in.txt","r",stdin);

    int n;
    int flag = 0;
    while(~scanf("%d",&n)){
        if(flag) puts("");
        a[n+1] = -1;
        for(int i = 1;i <= n;i++){
            scanf("%lld",a+i);
            sum[i] = a[i]+sum[i-1];
        }

        solve(n);
        flag = 1;
    }
    return 0;
}