Codeforces 279B Books

A - Books

 

#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define Max (int)1e5+10
int n, a[Max], t, sum[Max], i, j;
int main()
{

	while (cin >> n >> t)
	{
		sum[0]=0;
        for (i = 1; i <= n; i++)
	    {
		cin >> a[i];
		sum[i]=sum[i-1]+a[i];
		}		
		int k=n,ma=0;
        for(int i=n;i>0;i--)
        {
        
        	if(sum[i]-sum[k]>t&&k>=0)
        	     {
        	     	k--;
        	     	continue;
				 }
        	while(sum[i]-sum[k]<=t&&k>=0)
			      {
			       k--;
				   ma=max(ma,i-k-1);	
				   
				  }     
		}
	printf("%d\n", ma);

	}

	


	return 0;
}