POJ 3061 Subsequence 尺取

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<queue>
#include<deque>
#include<iomanip>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<fstream>
#include<memory>
#include<list>
#include<string>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MAXN 100004
#define L 31
#define INF 1000000009
#define eps 0.00000001
/*
尺取
*/
int a[MAXN], n, s;
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%d", &n, &s);
        for (int i = 0; i < n; i++)
            scanf("%d", &a[i]);
        int l = 0,sum = 0,ans = INF;
        for (int r = 0; r < n; r++)
        {
            sum += a[r];
            while (sum >= s)
            {
                sum -= a[l];
                ans = min(r - l + 1, ans);
                l++;
            }
        }
        if (ans != INF)
            printf("%d\n", ans);
        else
            printf("0\n");
    }
}