XDU暑训2019 Day8 POJ 3061 尺取 二分

题意：给一个序列和一个数S，求序列中子序列和大于等于S的最小序列长度
思路：先求前缀和，枚举左边界，用二分法求右边界为满足条件的第一个值，取这些序列长最小值输出

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int n, T, s, a[maxn], sum[maxn];
int main()
{
	cin >> T;
	for (int i = 0; i < T; i++) {
		cin >> n >> s;
		for (int i = 1; i <= n; i++)
			cin >> a[i];
		sum[1] = a[1];
		for (int i = 2; i <= n; i++)
			sum[i] = sum[i-1] + a[i];
		if (sum[n] < s) {
			cout << 0 << endl;
			continue;
		}
		int minn = n;
		for (int j = 1; sum[n]-sum[j] >= s; j++) {
			int t = lower_bound(sum+j+1, sum+n+1, sum[j]+s)-sum;
			minn = min(minn, t-j);
		}
		cout << minn << endl;
	}
	return 0;
}