Codeforces Round #510 (Div. 2) D

D. Petya and Array(权值线段树+离散)

https://codeforces.com/contest/1042/problem/D

大意:给定一组数a,问有多少个连续子区间[L,R]满足:sum[R]-sum[L-1] < t.

思路:先对数组a搞一个前缀和,然后枚举右端点去找左端点,左端点应满足sum[R]-t < sum[L-1],这个可以用权值线段树来查找.

什么是权值线段树呢? 权值线段树的结构和线段树是一样的,只不过权值线段树的节点存的是这个节点值出现的次数,也就相当于一个桶.但是题目的数据范围很大,所有必须离线化.

然后从前往后枚举右端点,按查询逆序数的方法来满足上述条件的点有多少个.

为了能够求sum[R]是否符合,在最开始前缀和中插入0.(sum[R]-0 = sum[R])

Code

---

#include <bits/stdc++.h>
#define ll long long
#define pir pair<int,int>
#define pirl pair<ll,ll>
#define debug(x) cout << #x << ":" << x << "\n"
const ll mod = 1e9+7;
const ll ds = 1e18;
const double eps = 1e-8;
ll read(){ll x=0,f=1;char c=getchar(); while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();} while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+c-'0',c=getchar(); return f*x;}
void print(ll x){ if(x < 0) {putchar('-');x = -x;} if(x/10) print(x/10); putchar(x%10+'0'); }

using namespace std;

const int N = 2e5+7;

ll sum[N],a[N],sum1[N],sum2[N],tree[N*4];
void update(int l,int r,int rt,int pos) {
	if(l >= r){
		tree[rt]++;
		return;
	}
	int mid = (l+r)>>1;
	if(pos <= mid) update(l,mid,rt*2,pos);
	else update(mid+1,r,rt*2+1,pos);
	tree[rt] = tree[rt*2]+tree[rt*2+1];
}

int query(int l,int r,int rt,int ql,int qr) {
	if(l >= ql && r <= qr) {
		return tree[rt];
	}
	if(l > qr || r < ql) return 0;
	if(l == r) return tree[rt];
	int mid = (l+r)>>1;
	if(qr <= mid) return query(l,mid,rt*2,ql,qr);
	else if(ql > mid) return query(mid+1,r,rt*2+1,ql,qr);
	else return (query(l,mid,rt*2,ql,mid)+query(mid+1,r,rt*2+1,mid+1,qr));
}

void solve() {
    ll n,m,t;
    ll cnt = 0;
    cin >> n >> t;
    for(int i = 1; i <= n; i++) {
    	cin >> a[i];
    	sum[i] = sum[i-1]+a[i];
    	sum1[i] = sum[i];
    	sum2[i] = sum[i];
    	//if(sum[i] < t) cnt++;
	}
	sum[n+1] = 0;
	sort(sum+1,sum+n+2);
	m = unique(sum+1,sum+n+2)-(sum+1);
	update(1,m,1,lower_bound(sum+1,sum+m+1,0)-sum);
	//cout << cnt << endl;
	for(int i = 1; i <= n; i++){
		int pos = upper_bound(sum+1,sum+m+1,sum1[i]-t)-sum;
		if(pos <= m) cnt += 1ll*query(1,m,1,pos,m);
		update(1,m,1,lower_bound(sum+1,sum+m+1,sum1[i])-sum);
	}
	cout << cnt << endl;
}

int main() {
//    int t;
//    cin >> t;
//    while(t--)
        solve();
    return 0;
}