https://ac.nowcoder.com/acm/contest/884/C
要用线段树( 4 ∗ m a x n 4*maxn 4∗maxn空间),不能用RMQ( m a x n ∗ l o g ( m a x n ) maxn*log(maxn) maxn∗log(maxn)空间),否则MLE。
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=3e6+100;
int n,a[maxn],b[maxn],pl[maxn],pr[maxn];
ll sum[maxn],ans=-1e9;
ll maxv[maxn*4],minv[maxn*4];
void build(int o,int l,int r)
{
if(l==r)minv[o]=maxv[o]=sum[l];
else
{
int m=