{"trustable":false,"sections":[{"title":"Description","value":{"format":"MD","content":"偷偷告诉你们一个秘密,RioTian学长是一个女装大佬,他喜欢收藏很多洛丽塔服装。有一天他发现自己的洛丽塔上有一个由n个数组成的数组,恰巧RioTian学长的幸运数字是s,RioTian学长想求出总和不小于s的连续元素的子数组长度的最小值,但RioTian学长忙着和小哥哥网恋,请你帮RioTian学长解决这个问题。\n\n"}},{"title":"Input","value":{"format":"MD","content":"第一行输入测试用例的数量t。\n对于每个测试用例,输入n(10 \u003c n \u003c 100 000)和s(s\u003c100 000 000),接下来输入n个正整数。\n数组元素均≤10000。\n"}},{"title":"Output","value":{"format":"MD","content":"找到满足要求的子数组的最小长度,如果没有,输出0。\n"}},{"title":"Sample Input","value":{"format":"MD","content":"```\n2\n10 15\n5 1 3 5 10 7 4 9 2 8\n5 11\n1 2 3 4 5\n```"}},{"title":"Sample Output","value":{"format":"MD","content":"```\n2\n3\n```"}}]}