Subsequence

 

A sequence of N positive integers (10 < N < 100000), 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 thesubsequence of consecutive elements of the sequence, the sum of which isgreater than or equal to S.

Input

The first line is the number of test cases. For each testcase 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 lineof the test case, separated by intervals. The input will finish with the end offile.

Output

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

Sample Input

2

10 15

5 1 3 5 10 7 4 9 2 8

5 11

1 2 3 4 5

Sample Output

2

3

问题分析：用arr[i]表示前i个数字的和，在都是正数的情况下肯定是越来越大的，那么可以证明在终点一定时，一步步增大起点缩小区间，然后缩小到和小于S后，增大终点，再继续讨论，不断比较得到最小区间。

（如果终点增大起点减小，那么之间的和一定增大，所以只要单向移动即可）

#include<bits/stdc++.h>
using namespace std;


int main()
{
	int T;
	int N,S;
	int arr[100010] = {0};
	
	cin >> T;
	while(T--){
		cin >> N >> S;
		int t;
		
		memset(arr,0,sizeof(arr));
		for(int i = 1; i <= N; i++){
			cin >> t;
			arr[i] = arr[i-1]+t;
		}
		
		
		int s = 1;
		int ans = N+1;
		
		for(int e = 1; e <= N; e++){
			if (arr[e] - arr[s-1] < S)
				continue;
			
			while(arr[e] - arr[s-1] >= S)		//这里循环结束时s多移了一位,e-s+1为当前的长度，最后结果加1为满足条件时的长度 
				s++;
			
	
			ans = min(ans,e-s+1);	
				
		}
		
		if (ans == N+1)
			printf("0\n");
		else	
			printf("%d\n",ans+1);	
		
	}

	return 0;
}