题意:给出5e5个数,每个数大小范围-1e5到1e5, 求一个最大的区间权值 = (区间中每个数的和)乘(区间中最小的数)
思路:暴力+路径压缩,枚举每个点为区间中最小的数,每个数有一个l和r代表区间左端点和右端点
代码:
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxx = 5e5+5;
long long a[maxx];
int l[maxx], r[maxx];
long long sum[maxx];
int main()
{
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
l[i] = r[i] = i, scanf("%lld", &a[i]), sum[i] = sum[i-1] + a[i];
a[0] = a[n+1] = -1e18;
for(int i = 1; i <= n; ++i)
{
if(a[i] > 0)
while(a[i] <= a[l[i]-1])
l[i] = l[l[i]-1];
else if(a[i] < 0)
{
long long mx = a[i];
int resl = l[i];
while(a[i] <= a[l[i]-1])
{
l[i] = l[l[i]-1];
if(sum[i]-sum[l[i]-1] < mx)
{
mx = sum[i]-sum[l[i]-1];
resl = l[i];
}
}
l[i] = resl;
}
}
for(int i = n; i >= 1; --i)
{
if(a[i] > 0)
while(a[i] <= a[r[i]+1])
r[i] = r[r[i]+1];
else if(a[i] < 0)
{
long long mx = a[i];
int resr = i;
while(a[i] <= a[r[i]+1])
{
r[i] = r[r[i]+1];
if(sum[r[i]]-sum[i-1] < mx)
{
mx = sum[r[i]]-sum[i-1];
resr = r[i];
}
}
r[i] = resr;
}
}
long long pp = 0;
for(int i = 1; i <= n; ++i)
pp = max(pp, a[i]*(sum[r[i]]-sum[l[i]-1]));
cout<<pp<<endl;
return 0;
}
// 5 1 -1 -2 -2 -3