int sum;
int ansi, ansj;
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
sum = 0;
for(int k = i; k <= j; k++){
sum += ls[k];
}
if(sum == x){
ansi = i; ansj = j;
goto ans;
}
}
}
ans:
printf("%d %d\n", ansi, ansj);


## Description

A sequence of $N$ positive integers $(10 < N < 100000)$, each of them less than or equal $10000$, and a positive integer $S(S < 100000000)$ 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$.

## 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


AC代码：

#include <cstdio>
#include <climits>
using namespace std;
int lis[100005];
long long sum;
int min(int a, int b){
if(a > b)
return b;
else return a;
}
int main(){
int T;
scanf("%d", &T);
while(T--){
int N, S;
scanf("%d %d", &N, &S);
for (size_t i = 0; i < (size_t)N; i++) {
scanf("%d", &lis[i]);
}
int left = 0, right = 0;
sum = lis[0];
int ans = INT_MAX;
while(left <= right && right < N){
if(sum < S){
right++;
sum += lis[right];
}else if(sum >= S){
ans = min(ans, right - left + 1);
sum -= lis[left];
left++;
}
}
if(ans != INT_MAX)
printf("%d\n", ans);
else printf("0\n");
}
}