UVALive - 2678 Subsequence

题目传送门

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define MAXN 100100
using namespace std;
int sum[MAXN];
int main(void)
{
	int N, S;

	while (scanf("%d%d", &N, &S) != EOF)
	{
		memset(sum, 0, sizeof(sum));
		scanf("%d", &sum[0]);
		for (int i = 1; i < N; i++)
		{
			int temp;

			scanf("%d", &temp);
			sum[i] = sum[i - 1] + temp;
		}
		int ans = N + 1;
		int j = 1;
		for (int i = 1; i <= N; i++)
		{//在当前前缀和以二分的方式寻找其最小满足的差值
			int j = lower_bound(sum, sum + i, sum[i] - S) - sum;
			if (j > 0)ans = min(ans, i - j + 1);
		}
		printf("%d\n", ans == N + 1 ? 0 : ans);
	}


	return 0;
}