Subsequence POJ - 3061

应用尺取法求

#include <iostream>
#include <limits.h>

using namespace std;

typedef long long ll;

ll a[100010];
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        ll b,c;
        cin>>b>>c;
        for(int i=0;i<b;i++)
            cin>>a[i];
        ll sum=0;
        int st,et;
        st=0;
        et=0;
        int ans=INT_MAX;
        while(1)
        {
            while(sum<c&&et<b)
            {
                sum+=a[et++];

            }

            if(sum<c)
                break;
            ans=min(ans,et-st);
            sum-=a[st++];
        }
        if(ans!=INT_MAX)
            cout<<ans<<endl;
        else
            cout<<"0"<<endl;
    }
    return 0;
}