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 C# (judge verdict: Accepted)

using System;
using System.Linq;//リストの使用
using System.Collections.Generic;
class Program
{
	static void Main()
	{
		string[] input = Console.ReadLine().Split(' ');//Splitで区切り文字を指定して複数個受け取る。
		long n = long.Parse(input[0]);
		long s = long.Parse(input[1]);
    long[] nums = Array.ConvertAll(Console.ReadLine().Split(' '),long.Parse);
    long answer = long.MaxValue;
    long sumMemo = 0;//総和
    long leftMemo = 0;//左の何番目を入れるか

    for(long i = 0; i < n; i++) sumMemo += nums[i];
    if(sumMemo < s) answer = 0;//要素の和をS以上にできない
    else
    {
      sumMemo = 0;
      for(long i = 0; i < n; i++)
      {
        sumMemo += nums[i];
        while(sumMemo >= s)
        {
          answer = Math.Min(answer, (i+1)-leftMemo);
          sumMemo -= nums[leftMemo];
          leftMemo++;
        }
      }
    }
    
		Console.WriteLine(answer);
	}
}