B. Books1400 / 二分答案

Posted 2021-11-22 幽殇默

https://codeforces.com/problemset/problem/279/B

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N],s[N],n,m;
bool check(int len) 
{
	for(int i=1;i<=n-len+1;i++)
		if(s[i+len-1]-s[i-1]<=m) return true;
	return false;
}
int main(void)
{
	cin>>n>>m;
	int minv=1e9;
	for(int i=1;i<=n;i++) cin>>a[i],s[i]=s[i-1]+a[i],minv=min(minv,a[i]);
	if(minv>m) 
	{
		puts("0");
		return 0;
	}
	int l=1,r=n;
	while(l<r)
	{
		int mid=l+r+1>>1;
		if(check(mid)) l=mid;
		else r=mid-1;
	}
	cout<<l<<endl;
	return 0;
}