```
//题目链接：https://ac.nowcoder.com/acm/contest/63602/L

include[HTML_REMOVED]

using namespace std;
const int N=2e5+10;
long long a[N],n,x,res;
void gb(long long a[],long long l,long long r)
{
if(l==r)return;
long long mad=(l+r)/2;
gb(a,l,mad);gb(a,mad+1,r);//将前缀和数组拆分成细微的小块
long long i=l,j=mad+1;//i到mad的原下标注定小于j的下标
while(i<=mad&&j<=r)
{
if(a[j]-a[i][HTML_REMOVED]>n>>x;
for(int i=1;i<=n;i++){cin>>a[i];a[i]=a[i-1]+a[i];}
gb(a,0,n);
cout<<res;
}` ``