题意:
解法:
枚举r,维护一个最小的l,满足sum[l,r]<=s,
此时[l+1,r],[l+2,r]...[r,r]中,每个区间的和一定也是<=s的,
满足条件的左端点取值范围为[l,r],一共r-l+1个,因此答案累加r-l+1.
显然l的移动是向右单调的.
code:
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxm=3e5+5;
int a[maxm];
int n,s;
void solve(){
cin>>n>>s;
for(int i=1;i<=n;i++)cin>>a[i];
int sum=0,l=1;
int ans=0;
for(int i=1;i<=n;i++){
sum+=a[i];
while(sum>s)sum-=a[l++];
ans+=i-l+1;
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);cin.tie(0);
solve();
return 0;
}