注意到当固定
i
i
i时,往右扫描
j
j
j,实际上是维护一个以
a
i
a_i
ai起始的严格递增子序列,每次为其中所有的项增加对应的值,所以这个严格递增子序列中的每一项都有一个最优区间
[
l
x
,
r
x
]
[l_x,r_x]
[lx,rx],即当
l
x
≤
j
≤
r
x
l_x\le j\le r_x
lx≤j≤rx时,
f
(
i
,
j
)
=
a
x
(
j
−
x
+
1
)
f(i,j)=a_x(j-x+1)
f(i,j)=ax(j−x+1)。
用单调队列维护这个严格递增子序列,从后往前扫描
i
i
i,每次将
a
i
a_i
ai插入队列并更新即可。时间复杂度
O
(
n
)
O(n)
O(n)。
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
#define clr(a) memset(a,0,sizeof(a))
const ll md=1e9+7;
//--Container
//--
ll ar[200010];int n,tn=0;tuple<ll,int,int,int>tr[200010];
inline ll _cd(ll l,ll r){return ((l+r)*(r-l+1)/2)%md;};
void cl(){
int i,j,k,d,t;ll rs=0,ts=0;scanf("%d",&n);for(i=0;i<n;scanf("%lld",&ar[i++]));
for(i=n-1;i>=0;--i){
tuple<ll,int,int,int>ti=make_tuple(ar[i],i,i,i);for(tr[++tn]=ti;tn>1;){
ll s0=get<0>(tr[tn]);int l0=get<1>(tr[tn]),r0=get<2>(tr[tn]),id0=get<3>(tr[tn]);
ll s1=get<0>(tr[tn-1]);int l1=get<1>(tr[tn-1]),r1=get<2>(tr[tn-1]),id1=get<3>(tr[tn-1]);
if(s0*(r1-id0+1)>=s1*(r1-id1+1)){
tr[--tn]=make_tuple(s0,l0,r1,id0);
ts=(ts+md-(s1*_cd(l1-id1+1,r1-id1+1))%md)%md;
}
else if(s0*(l1-id0+1)<=s1*(l1-id1+1)){
break;
}else{
ll _t=s1-s0,_a=s0*(l1-id0+1)-s1*(l1-id1+1),_r;
_r=_a/_t;if(_t*_r<_a)++_r;
tr[tn]=make_tuple(s0,l0,l1+_r-1,id0);
tr[tn-1]=make_tuple(s1,l1+_r,r1,id1);
ts=(ts+md-(s1*_cd(l1-id1+1,l1+_r-id1))%md)%md;
}
}
ts+=get<0>(tr[tn])*_cd(get<1>(tr[tn])-get<3>(tr[tn])+1,get<2>(tr[tn])-get<3>(tr[tn])+1)%md;ts%=md;
rs+=ts;rs%=md;
}
printf("%lld\n",rs);
};
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif // ONLINE_JUDGE
cl();
return 0;
};