Type: RemoteJudge 1000ms 64MiB

Subsequence

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum of which is greater than or equal to S.

Input

The first line is the number of test cases. For each test case the program has to read the numbers N and S, separated by an interval, from the first line. The numbers of the sequence are given in the second line of the test case, separated by intervals. The input will finish with the end of file.

Output

For each the case the program has to print the result on separate line of the output file.if no answer, print 0.

2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5
2
3

Source

Southeastern Europe 2006

2023/03/25 双指针算法-随堂测验

Not Attended
Status
Done
Rule
Ledo
Problem
10
Start at
2023-3-25 10:00
End at
2023-3-25 11:00
Duration
1 hour(s)
Host
Partic.
28