Live Archive 2678 Subsequence

///方法一：前缀和 + 二分
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define min(a,b) (a < b ? a : b)

const int maxn = 100090;
int a[maxn];
int b[maxn];
int main()
{
    int n, s;
    while(~scanf("%d%d",&n,&s)){
        b[0]=0;
        for(int i=1;i<=n;++i){
            scanf("%d",&a[i]);
            b[i] = b[i-1] + a[i];
        }
        int ans = maxn;
        for(int i = n; i >= 1; --i){
            int j = lower_bound(b, b + i, b[i] - s) - b;
            if(j > 0)ans = min(ans, i - j + 1);
        }
        if(ans < maxn)
            printf("%d\n", ans);
        else printf("0\n");
    }
    return 0;
}

///方法二：尺取法
int main(){
    ios_base::sync_with_stdio(0);
    int n, s;
    while(~scanf("%d%d", &n, &s)){
        b[0] = 0; a[0] = 0;
        for(int i = 1; i <= n; ++i){
            scanf("%d",&a[i]);
            b[i] = b[i-1] + a[i];
        }
        int ans = n+1;
        int i = 0, j = 1;
        for( ; j <= n; ){
            while(b[i]>b[j]-s&&j<=n)j++;  //这里必须有 j <= n ，不然会 RE

            if(j>n||i>n)break;
            ans = min(ans, j - i);
            i++;
        }
        if(ans == n+1)printf("0\n");
        else printf("%d\n",ans);
    }
    return 0;
}