Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

The Smallest Window I

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.

Constraints

$1 \leq N \leq 10^5$

$1 \leq S \leq 10^9$

$1 \leq a_i \leq 10^4$

Input

The input is given in the following format.

$N$ $S$

$a_1$ $a_2$ ... $a_N$

Output

Print the smallest sub-array size in a line.

Sample Input 1

6 4
1 2 1 2 3 2

Sample Output 1

2

Sample Input 2

6 6
1 2 1 2 3 2

Sample Output 2

3

Sample Input 3

3 7
1 2 3

Sample Output 3

0

Solution in Scala (judge verdict: Accepted)

import java.util.Scanner
import scala.collection.mutable.Stack 

object Main extends App { 
  val sc = new Scanner(System.in)
  val N, S = sc.nextInt()
  val array = (for (i <- 0 until N) yield sc.nextInt()).toArray

  def solver(l:Int, r:Int, acc:Int, len:Int):Int = {
    if (r >= N && acc < S) if (len < N+1) len else 0
    else if (acc < S) solver(l, r+1, acc+array(r), len)
    else solver(l+1, r, acc-array(l), len min (r-l))
  }

  println(solver(0, 0, 0, N+1))
}