题意：给定一个序列以及整数s，求出总和不少于s的连续子序列长度的最小值，如果不存在则输出0
思路：尺取法求解
#include <cstdio> #include <iostream> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 10; int T, n, s, a[maxn]; int main() { scanf("%d", &T); while (T--) { scanf("%d %d", &n, &s); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } int L = 0, R = 0, sum = 0, ans = INF; for (R = 0; R < n; R++) { sum += a[R]; if (sum >= s) { while (sum >= s) { ans = min(ans, R - L + 1); sum -= a[L]; L++; } } } if (ans == INF) { ans = 0; } printf("%d\n", ans); } return 0; }