Massive

https://ac.nowcoder.com/acm/contest/700/C

题意：n个数，连续区间长度在[L,R]之间的和大于等于s的个数；

思路：前缀和离散化加树状数组；枚举起点同时更新数组数组的值（前缀和的值）；每次差值的因为要满足sum[j]-sum[i-1]>=s;

所以每次找的sum[j]>=sum[i-1]+s;

反思：题解都看到老半天~，离散化也不记得了，完全意识不到这些做法；不懂得可以用树状数组查询比一个数大的个数的操作；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

ll sum[maxn],mp[maxn];
ll tree[maxn];
int n,m;
void add(int x,int v)
{
    while(x<=m)
    {
        tree[x]+=v;
        x+=lowbit(x);
    }
}
int get(int x)
{
    int ans=0;
    while(x)
    {
        ans+=tree[x];
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int l,r;
    ll s;
    cin>>n>>l>>r>>s;
    for(int i=1;i<=n;i++)
    {
        ll x;
        cin>>x;
        sum[i]=sum[i-1]+x;
        mp[i]=sum[i];
    }
    /*for(int i=1;i<=n;i++)
    {
        cout<<sum[i]<<" ";
    }
    cout<<endl;*/
    sort(mp+1,mp+1+n);
    m=unique(mp+1,mp+1+n)-mp-1;
    for(int i=1;i<=n;i++)
    {
        int pos=lower_bound(mp+1,mp+1+m,sum[i])-mp;
        sum[i]=pos;
    }
    /*for(int i=1;i<=n;i++)
    {
        cout<<mp[i]<<" ";
    }
    cout<<endl;
    for(int i=1;i<=n;i++)
    {
        cout<<sum[i]<<" ";
    }
    cout<<endl;*/
    for(int i=l;i<=r;i++)//先从1开始的合法区间
    {
        add(sum[i],1);
    }
    ll ans=0;
    for(int i=1;i<=n;i++)//枚举区间起点
    {
        int pos=lower_bound(mp+1,mp+1+m,mp[sum[i-1]]+s)-mp-1;//减一是因为要减去比它小的
        ans+=get(m)-get(pos);
        add(sum[l++],-1);//i+1，l、r都要右移，同时减去之前的区间；
        if(r<n) add(sum[++r],1);
        if(l>n) break;
    }
    cout<<ans<<endl;
	return 0;
}