8645: DSL_3_A : The Smallest Window I
[Creator : ]
Description
For a given array $a_1,a_2,a_3,...,a_N$ of N elements and an integer S, find the smallest sub-array size (smallest window length) where the sum of the sub-array is greater than or equal to S. If there is not such sub-array, report 0.
Input
The input is given in the following format.
$N$ $S$
$a_1\ a_2\ ...\ a_N$
$N$ $S$
$a_1\ a_2\ ...\ a_N$
Output
Print the smallest sub-array size in a line.
Sample 1 Input
6 4
1 2 1 2 3 2
Sample 1 Output
2
Sample 2 Input
6 6
1 2 1 2 3 2
Sample 2 Output
3
Sample 3 Input
3 7
1 2 3
Sample 3 Output
0
HINT
相同题目：DSL_3_A。