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;

public class hello
{
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var n = int.Parse(line[0]);
        var s = int.Parse(line[1]);
        var a = new int[n + 1];
        string[] line2 = Console.ReadLine().Trim().Split(' ');
        var te = Array.ConvertAll(line2, int.Parse);
        for (int i = 0; i < n; i++)
            a[i + 1] = a[i] + te[i];
        if (a[n] < s) { Console.WriteLine(0); goto end; }
        var ans = GetAns(a, s, n);
        if (ans == 999999) Console.WriteLine(0);
        else Console.WriteLine(ans);
        end:;
    }
    public static int GetAns (int[] a ,int s ,int n)
    {
        var ans = 999999;
        for (int i = 0;  a[i] +s <= a[n]; i++)
            for (int j = i+1; j <= n ; j++)
                if (a[i] + s <= a[j]) { ans = Math.Min(ans, j - i); break; }
        return ans;
    }
}