题目链接:Sequence
题意:对于所有的 l,r 求
思路:对于每一个,假设当作最小值,然后求出作用的区间 ,单调栈就可以。当<0时 ,需要找 最小
那么就需要 右边取前缀最小的,左边取前缀最大的,ai>=0时,就是反过来的。
这个和南昌网络赛基本一样Max Answer
#include <iostream>
#include <cstdio>
#include <stack>
#define ll long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
const int maxn = 3e6+5;
struct Tree {
int l, r;
ll maxx, minn;
}e[maxn<<2];
ll a[maxn], b[maxn], sum[maxn], ans;
int l[maxn], r[maxn];
void pushup(int cur) {
e[cur].maxx = max(e[cur<<1].maxx, e[cur<<1|1].maxx);
e[cur].minn = min(e[cur<<1].minn, e[cur<<1|1].minn);
}
void build(int l, int r, int cur) {
e[cur].l = l;
e[cur].r = r;
if(l==r) {
e[cur].maxx = sum[l];
e[cur].minn = sum[l];
return ;
}
int mid = l + r >> 1;
build(l, mid, cur<<1);
build(mid+1, r, cur<<1|1);
pushup(cur);
}
ll querymax(int l, int r, int cur) {
if(l <= e[cur].l && e[cur].r <= r) {
return e[cur].maxx;
}
ll ans = -INF;
int mid = e[cur].l + e[cur].r >> 1;
if(l <= mid) ans = max(ans, querymax(l, r, cur<<1));
if(r > mid) ans = max(ans, querymax(l, r, cur<<1|1));
return ans;
}
ll querymin(int l, int r, int cur) {
if(l <= e[cur].l && e[cur].r <= r) {
return e[cur].minn;
}
ll ans = INF;
int mid = e[cur].l + e[cur].r >> 1;
if(l <= mid) ans = min(ans, querymin(l, r, cur<<1));
if(r > mid) ans = min(ans, querymin(l, r, cur<<1|1));
return ans;
}
int main()
{
int n;
scanf("%d", &n);
sum[0] = 0;
for(int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
for(int i = 1; i <= n; i++) {
scanf("%lld", &b[i]);
sum[i] = sum[i - 1] + b[i];
}
build(0, n, 1);
stack<int> s1, s2;
for(int i = 1; i <= n; i++) {
while(!s1.empty() && a[i] <= a[s1.top()]) s1.pop();
if(s1.empty()) l[i] = 1;
else l[i] = s1.top() + 1;
s1.push(i);
}
for(int i = n; i >= 1; i--) {
while(!s2.empty() && a[i] <= a[s2.top()]) s2.pop();
if(s2.empty()) r[i] = n;
else r[i] = s2.top() - 1;
s2.push(i);
}
for(int i = 1; i <= n; i++) {
if(a[i] < 0) {
ans = max(ans, a[i] * (querymin(i, r[i], 1) - querymax(l[i] - 1, i - 1, 1)));
}
else
ans = max(ans, a[i] * (querymax(i, r[i], 1) - querymin(l[i] - 1, i - 1, 1)));
}
printf("%lld\n", ans);
return 0;
}