标签：des style blog http color java os io
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
注意解题方法
#include<stdio.h> #include<algorithm> using namespace std; int main() { int n,t,a[100001],k,max1,sum[100001],i,j; while(~scanf("%d %d",&n,&t)) { sum[0]=0; max1=0; k=n; for(i=1;i<=n;i++) { scanf("%d",&a[i]); sum[i]=sum[i-1]+a[i]; } for(j=n;j>=1;j--) { if(sum[j]-sum[k]>t&&k>=0) { k--; continue; } while(sum[j]-sum[k]<=t&&k>=0) { k--; max1= max(max1,j-k+1); } } printf("%d\n",max1-2); } return 0; }
标签：des style blog http color java os io
原文地址：http://www.cnblogs.com/lipching/p/3904010.html
