给定 N (1 < N < 100 000) 个小于等于 10000 的正整数组成的序列和一个正整数 S (S < 100 000 000)。请编写一个程序，查找该序列中是否有连续元素组成的子序列，其和大于等于 S。如果找到，则输出符合条件的最短子序列的长度，如果没有找到，则输出 0-Given N (1 < N < 100 000) were less than or equal to 10000, composed of positive integer sequences and a positive integer S (S < 100 000 000). Please prepare a program to find whether the sequence of consecutive sub-sequence of elements, and greater than or equal to the S. If found eligible then the output sequence of the length of the shortest, if not found, then output 0