题目描述:
![请添加图片描述](https://img-blog.csdnimg.cn/ac63ffaa843d48d98e5e951564d440f7.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBA5YmBZGlvZGlv,size_20,color_FFFFFF,t_70,g_se,x_16)
题解:
![请添加图片描述](https://img-blog.csdnimg.cn/33b8624fd88647d9a31beedf3e35d237.jpg?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBA5YmBZGlvZGlv,size_20,color_FFFFFF,t_70,g_se,x_16)
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod=1000000007,N=5e5+5;
int n;
LL sum[5][N];
LL a[N],b[N];
vector<LL>vec;
LL tr[N],m;
int findx(LL x)
{
return lower_bound(vec.begin(), vec.end(), x)-vec.begin();
}
int lowbit(int x){return x&(-x);}
void add(int x)
{
for(int i=x;i<m;i+=lowbit(i))tr[i]++;
}
LL query(int x)
{
LL res=0;
for(int i=x;i;i-=lowbit(i))res+=tr[i];
return res;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=3;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%lld",&sum[i][j]);
sum[i][j]+=sum[i][j-1];
}
}
vec.push_back(-1e18);
for(int i=1;i<=n;i++)
{
a[i]=sum[1][i]-sum[2][i-1];vec.push_back(a[i]);
b[i]=sum[3][i-1]-sum[2][i]-sum[3][n];
}
sort(vec.begin(),vec.end());
vec.erase(unique(vec.begin(),vec.end()),vec.end());
m=vec.size();
LL res=0;
for(int i=1;i<=n;i++)
{
add(findx(a[i]));
int p=findx(b[i]);
res=(res+query(m-1)-query(p-1))%mod;
}
printf("%lld",res);
}