Codeforces Round #171 (Div. 2)B.Books（尺取法）

传送门

Description

When Valera has got some free time, he goes to the library to read some books. Today he's got t free minutes to read. That's why Valera took n books in the library and for each book he estimated the time he is going to need to read it. Let's number the books by integers from 1 to n. Valera needs ai minutes to read the i-th book.

Valera decided to choose an arbitrary book with number i and read the books one by one, starting from this book. In other words, he will first read book number i, then book number i + 1, then book number i + 2 and so on. He continues the process until he either runs out of the free time or finishes reading the n-th book. Valera reads each book up to the end, that is, he doesn't start reading the book if he doesn't have enough free time to finish reading it.

Print the maximum number of books Valera can read.

Input

The first line contains two integers n and t (1 ≤ n ≤ 105; 1 ≤ t ≤ 109) — the number of books and the number of free minutes Valera's got. The second line contains a sequence of n integers a1, a2, ..., an (1 ≤ ai ≤ 104), where number ai shows the number of minutes that the boy needs to read the i-th book.

Output

Print a single integer — the maximum number of books Valera can read.

Sample Input

4 5
3 1 2 1


3 3
2 2 3

Sample Output

3

1

思路

题意：

给定时间t以及每本书所需阅读时间，问在连续区间最多能读多少本书。

 

+ View Code?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

#include<bits/stdc++.h> using namespace std; const int maxn = 100005; int a[maxn];   int main() {     //freopen("input.txt","r",stdin);     int n,t,res = 0;     scanf("%d%d",&n,&t);     for (int i = 0;i < n;i++)    scanf("%d",&a[i]);     int st = 0,ed = 0,sum = 0;     for (;;)     {         if (ed >= n) break;         while (ed < n && sum < t)         {             sum += a[ed++];         }         if (sum > t) sum -= a[--ed];         if (ed > n)  break;         res = max(res,ed - st);         sum -= a[st++];     }     printf("%d\n",res);     return 0; }