题目链接
题目大意是指选一段连续的区间 用区间的最小值乘上和 最大。
思路:
先求出前缀和,用线段树维护出每个区间的最大值和最小值,用单调栈维护每个数作为最小值的左右区间,如果这个最小值是正数,那么直接用这个数乘上前缀和一定最大,那如果是负数,那么 就应该求出右区间的前缀和的最小值,减去左区间的最大值, 这样算出来的和一定是最小的用负数相乘反而最大
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
const int maxn = 1e6 + 10;
int sum[maxn << 1] , minsum[maxn << 2] , maxsum[maxn << 2];
int L1[maxn << 1] , R1[maxn << 1];
int a[maxn];
void build(int l, int r, int rt){
if(l == r){
minsum[rt] = maxsum[rt] = sum[l];
return ;
}
int mid = (l + r) >> 1;
build(l , mid, rt << 1);
build(mid + 1, r , rt <<1|1);
maxsum[rt] = max(maxsum[rt << 1], maxsum[rt << 1 | 1]);
minsum[rt] = min(minsum[rt << 1], minsum[rt << 1 | 1]);
}
int miquary(int L ,int R, int l, int r, int rt){
if(l >= L && r <= R)
return minsum[rt];
int mid = (l + r) >> 1;
int ans = INF;
if(L <= mid) ans = min(ans , miquary(L, R ,l , mid, rt << 1));
if(mid < R) ans = min(ans , miquary(L, R ,mid + 1 ,r , rt << 1| 1));
return ans;
}
int maquary(int L ,int R, int l, int r, int rt){
if(l >= L && r <= R)
return maxsum[rt];
int mid = (l + r) >>1;
int ans = -INF;
if(L <= mid) ans = max(ans , maquary(L, R ,l , mid, rt << 1));
if(mid < R) ans = max(ans , maquary(L, R ,mid + 1 ,r , rt << 1| 1));
return ans;
}
signed main()
{
int n;
cin >> n;
for(int i = 1; i <= n; i ++){
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
build(1, n ,1);
a[n + 1] = -INF;
stack<int > st;
for(int i = 1; i <= n + 1;i ++){
while(!st.empty() && a[st.top()] > a[i]){
R1[st.top()] = i;
st.pop();
}
st.push(i);
}
while(!st.empty()) st.pop();
a[0] = -INF;
for(int i = n; i >= 0; i --){
while(!st.empty() && a[st.top()] > a[i]){
L1[st.top()] = i;
st.pop();
}
st.push(i);
}
int ans = -INF;
for(int i = 1; i <= n; i ++){
if(a[i] >= 0){
ans = max(ans, a[i]*(sum[R1[i] - 1] - sum[L1[i]]));
}
else{
int ans1 = miquary(i , R1[i] - 1, 1 , n, 1);
int ans2 = maquary(L1[i] + 1, i, 1,n,1);
// cout << ans1 <<" " << ans2 << endl;
ans = max(ans , a[i]*(ans1 - ans2));
}
}
cout << ans << endl;
}