好像就我的做法麻烦,但是
O(nlogn)
的树状数组加仅用于求最小值的酱油线段树;
首先,我们可以注意到对于每个询问均可以被其中的最小值切裂成两部分
以此为划分依据,答案可以分成4部分;
(规定
l[i]
为i处向左第一个比a[i]小的位置+1,
r[i]
为i处向右第一个比a[i]小的位置-1)
设询问ql,qr讨论ql<=i<=qr的所有数产生的贡献;
1.所有l[i]<=ql , r[i]
<
<script type="math/tex" id="MathJax-Element-103"><</script>qr的
2.所有l[i]>ql , r[i]
>=
qr的
3.所有l[i]>ql , r[i]
<
<script type="math/tex" id="MathJax-Element-105"><</script>qr的
4.所有l[i]<=ql , r[i]>=qr的,即最小值
对于1,2,3单调栈树状数组
对于4,线段树
对于数字重复需要稍稍处理一下
1A感动。。。。。。
#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=n;i++)
#define rep2(i,k,n) for(int i=k;i>=n;i--)
#define ls x<<1
#define rs x<<1|1
using namespace std;
typedef long long ll;
const int N=2e5+7;
const int inf=0x3f3f3f3f;
ll ans[N],W[N];int l[N],r[N],a[N],n,q,ql[N],qr[N],stk[N],top=0,b[N];
struct Tu{
struct E{
int to,next;E(int to=0,int next=0):to(to),next(next){}
}edge[N<<1];
int head[N],tot;
Tu(){tot=0;}
void add(int x,int y){
edge[++tot]=E(y,head[x]);head[x]=tot;
}
}t1,t2;
struct fen{
ll tr[N];
void Add(int x,ll d){
for(;x<=n;x+=(x&-x))tr[x]+=d;
}
ll Q(int x){
ll res=0;for(;x;x-=(x&-x))res+=tr[x];return res;
}
void init(){
memset(tr,0,sizeof(tr));
}
}sum,all;
void solve_part1(){
top=0;
ll T=0;
rep2(i,n,1){T++;
while(top && a[stk[top]]>a[i]){
int u=stk[top];top--;
all.Add(r[u],1ll*(n-u)*(r[u]-u+1)*a[u]);
sum.Add(r[u],-1ll*a[u]*(r[u]-u+1));
}
all.Add(r[i],-1ll*(n-i)*(r[i]-i+1)*a[i]);
sum.Add(r[i],1ll*a[i]*(r[i]-i+1));
stk[++top]=i;
for(int j=t1.head[i];j;j=t1.edge[j].next){
int v=t1.edge[j].to;
ll val=T*sum.Q(qr[v]-1)+all.Q(qr[v]-1);
ans[v]+=val;
}
}
}
struct fen_2{
ll tr[N];
void Add(int x,ll d){
for(;x;x-=(x&-x))tr[x]+=d;
}
ll Q(int x){
ll res=0;for(;x<=n;x+=(x&-x))res+=tr[x];return res;
}
void init(){
memset(tr,0,sizeof(tr));
}
}sum_2,all_2;
void solve_part2(){
top=0;
ll T=0;
rep(i,1,n){T++;
while(top && a[stk[top]]>=a[i]){
int u=stk[top];top--;
all_2.Add(l[u],1ll*(u-1)*(u-l[u]+1)*a[u]);
sum_2.Add(l[u],-1ll*a[u]*(u-l[u]+1));
}
all_2.Add(l[i],-1ll*(i-1)*(i-l[i]+1)*a[i]);
sum_2.Add(l[i],1ll*a[i]*(i-l[i]+1));
stk[++top]=i;
for(int j=t2.head[i];j;j=t2.edge[j].next){
int v=t2.edge[j].to;
ll val=T*sum_2.Q(ql[v]+1)+all_2.Q(ql[v]+1);
ans[v]+=val;
}
}
}
bool cmp(int x,int y){
return l[x]>l[y];
}
void solve_part3(){
sum.init();
rep(i,1,n)b[i]=i;
sort(b+1,b+n+1,cmp);
int now=1;
rep2(i,n,1){
for(int j=t1.head[i];j;j=t1.edge[j].next){
int v=t1.edge[j].to;
ans[v]+=sum.Q(qr[v]-1);
}
for(;l[b[now]]==i;now++)sum.Add(r[b[now]],W[b[now]]);
}
}
int mi[N<<2];
void build(int x,int l,int r){
if(l==r){mi[x]=l;return;}
int mid=(l+r)>>1;
build(ls,l,mid);
build(rs,mid+1,r);
if(a[mi[ls]]<a[mi[rs]]){
mi[x]=mi[ls];
}
else mi[x]=mi[rs];
}
int Q(int x,int l,int r,int q_l,int q_r){
if(q_l<=l && r<=q_r){
return mi[x];
}else{
int mid=(l+r)>>1;
int res1=0,res2=0;
if(q_l<=mid)res1=Q(ls,l,mid,q_l,q_r);
if(q_r>mid)res2=Q(rs,mid+1,r,q_l,q_r);
if(a[res1]<a[res2])return res1;
else return res2;
}
}
void solve_part4(){
build(1,1,n);
rep(i,1,q){
int res=Q(1,1,n,ql[i],qr[i]);
ans[i]+=1ll*(qr[i]-res+1)*(res-ql[i]+1)*a[res];
}
}
int main(){
scanf("%d%d",&n,&q);
rep(i,1,n)scanf("%d",&a[i]);a[0]=inf;
rep(i,1,n){r[i]=i;
while(top && a[stk[top]]>=a[i])r[stk[top--]]=i-1;
stk[++top]=i;
}
while(top)r[stk[top--]]=n;
top=0;
rep2(i,n,1){l[i]=i;
while(top && a[stk[top]]>a[i])l[stk[top--]]=i+1;
stk[++top]=i;
}
while(top)l[stk[top--]]=1;
rep(i,1,n)W[i]=1ll*a[i]*(r[i]-i+1)*(i-l[i]+1);
rep(i,1,q){
scanf("%d%d",&ql[i],&qr[i]);
t1.add(ql[i],i);
t2.add(qr[i],i);
}
solve_part1();
solve_part2();
solve_part3();
solve_part4();
rep(i,1,q)printf("%lld\n",ans[i]);
return 0;
}