Subsequence 尺取法

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
const int maxn = 100010;
typedef long long ll;
int t,n,ss;
int s[maxn];
int main()
{
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&ss);
        for(int i =0;i<n;i++) scanf("%d",s+i);
        int l=0,r=0,sum=0,res=maxn;
        while(1){
            while(r<n&&sum<ss){
                sum+=s[r++];
            }
            if(sum<ss) break;
            res=min(res,r-l);
            sum-=s[l++];
        }
        if(res==maxn) printf("0\n");
        else  printf("%d\n",res);
    }
}