Subsequence POJ - 3061

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<string>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<cmath>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long
#define MAX_N 1000005
#define gcd(a,b) __gcd(a,b)
#define mem(a,x) memset(a,x,sizeof(a))
#define mid(a,b) a+b/2
#define stol(a) atoi(a.c_str())//string to long
int temp[MAX_N];
int main(){
    //std::ios::sync_with_stdio(false);
    //std::cin.tie(0);
//    #ifndef ONLINE_JUDGE
//        freopen("D:\\in.txt","r",stdin);
//        freopen("D:\\out.txt","w",stdout);
//    #else
//    #endif
    int T;
    scanf("%d",&T);
    int N,S;
    while(T--){
        scanf("%d%d",&N,&S);
        for(int i = 0; i < N; i++)
            scanf("%d",&temp[i]);
        int sum = 0;
        queue<int> que;
        int res = inf;
        for(int i = 0; i < N; i++){
            que.push(temp[i]);
            sum += temp[i];
            while(sum >= S){
                res = min(res,(int)que.size());
                sum -= que.front();
                que.pop();
            }
        }
        if(res!=inf)
            printf("%d\n",res);
        else
            printf("0\n");
    }
    return 0;
}