题目链接:点击这里
PS:之前这个题是用动态开点的权值线段树写的,后来看到有大佬有cdq分治解决了这个问题,于是来学习记录一下这种解法,以加深对cdq分治的理解
题目大意:
给定一个长度为
n
n
n 的序列 ,现在要从中选出一段连续子序列
[
l
,
r
]
[l,r]
[l,r] ,使得
L
≤
∑
i
=
l
r
a
i
≤
R
L \le \sum^r_{i = l}a_i \le R
L≤∑i=lrai≤R ,求符合条件的子序列数量
题目分析:
记
s
u
m
x
=
∑
i
=
1
x
a
i
sum_x=\sum^x_{i=1}a_i
sumx=∑i=1xai ,故
∑
i
=
l
r
a
i
=
s
u
m
r
−
s
u
m
l
−
1
\sum^r_{i=l}a_i=sum_r-sum_{l-1}
∑i=lrai=sumr−suml−1,故式子
L
≤
∑
i
=
l
r
a
i
≤
R
L \le \sum^r_{i = l}a_i \le R
L≤∑i=lrai≤R 可化为
L
≤
s
u
m
r
−
s
u
m
l
−
1
≤
R
L \le sum_r-sum_{l-1} \le R
L≤sumr−suml−1≤R 这个式子可以分成
L
≤
∑
i
=
l
r
a
i
L \le \sum^r_{i = l}a_i
L≤∑i=lrai 和
∑
i
=
l
r
a
i
≤
R
\sum^r_{i = l}a_i \le R
∑i=lrai≤R 两部分通过
O
(
n
)
O(n)
O(n) 的单调队列维护,于是便可以用cdq分治的思想解决这个问题了
时间复杂度
O
(
n
l
o
g
2
n
)
O(nlog^2n)
O(nlog2n)
具体细节见代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
using namespace std;
ll read()
{
ll res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 1e5+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
ll n,L,R,ans,sum[maxn];
void cdq(int l,int r)
{
if(l == r) return ;
int mid = (l+r)>>1;
cdq(l,mid);cdq(mid+1,r);
int head = l,tail = l-1;
for(int i = mid+1;i <= r;i++)
{
while(tail < mid && sum[i]>=sum[tail+1]+L) tail++;
while(head <= mid && sum[i]>sum[head]+R) head++;
ans += tail-head+1;
}
sort(sum+l,sum+r+1);
}
int main()
{
n = read(),L = read(),R = read();
for(int i = 1;i <= n;i++)
{
ll x = read();
sum[i] = sum[i-1]+x;
}
cdq(0,n);
printf("%lld\n",ans);
return 0;
}