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)

#include <stdio.h>

int main() {
  int n, s, i;
  scanf("%d %d", &n, &s);
  
  int arr[n];

  for (i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
  }

  int curSum = arr[0], curSize = 0, smallestSize = n + 1;
  int left = 0, right = 0;

  while (1) {
    if (right > n - 1) {
      break;
    }

    //printf("curSum is: %d, left is: %d, right is: %d\n", curSum, left, right);
    if (curSum >= s) {
      curSize = right + 1 - left;
      smallestSize = smallestSize < curSize ? smallestSize : curSize;
      curSum -= arr[left];
      left++;
    } else {
      right++;
      curSum += arr[right];
    }
  }

  if (smallestSize == n + 1)
    smallestSize = 0;

  printf("%d\n", smallestSize);
}