Codeforces Round #510 (Div. 2) D. Petya and Array

题意：
给出一个序列a，求区间[i,j]的个数，使得和小于t

树状数组维护前缀和

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>
#include <cmath>
#include <queue>

using namespace std;

int n;
long long t;
long long a[200005];
long long b[200005];
int cnt;

long long tr[200005];
int lb(int x)
{
    return x&(-x);
}

void add(int x)
{
    while(x<=200002)
    {
        tr[x]++;
        x+=lb(x);
    }
}
long long get(int x)
{
    long long ans=0;
    while(x>0)
    {
        ans+=tr[x];
        x-=lb(x);
    }
    return ans;
}
int main() {

    while(~scanf("%d%lld",&n,&t))
    {
        memset(tr,0,sizeof(tr));
        memset(a,0,sizeof(a));
        for(int i=1;i<=n;i++)
            scanf("%lld",&a[i]),a[i]+=a[i-1];

        for(int i=0;i<=n;i++)
        {
            b[i]=a[i];
        }
        sort(b,b+n+1);
        cnt=unique(b,b+n+1)-b;

        long long ans=0;
        int id=lower_bound(b,b+cnt,a[0])-b;
        add(id+1);

        //sort(a+1,a+n+1);
        for(int i=1;i<=n;i++)
        {
            long long tp=a[i]-t;
            id=upper_bound(b,b+cnt,tp)-b;
            id--;id++;
            if(id!=0)
            {
                ans+=(i-get(id));
            } else
                ans+=i;
            id=lower_bound(b,b+cnt,a[i])-b;
            add(id+1);
        }
        printf("%lld\n",ans);
    }
    return 0;
}