Subsequence

最新推荐文章于 2021-02-21 10:11:59 发布

杨.某某

最新推荐文章于 2021-02-21 10:11:59 发布

阅读量287

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/qq_37823003/article/details/76207621

本文介绍了一种寻找序列中最短连续子序列的问题，该子序列的元素和需大于或等于给定值S。通过二分查找优化算法实现，提供了一个有效的解决方案。

点击打开链接

Subsequence

A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum of which is greater than or equal to S.

Input

The first line is the number of test cases. For each test case the program has to read the numbers N and S, separated by an interval, from the first line. The numbers of the sequence are given in the second line of the test case, separated by intervals. The input will finish with the end of file.

Output

For each the case the program has to print the result on separate line of the output file.if no answer, print 0.

Sample Input

2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5

Sample Output

2
3

题解：像我这种英语特别差的，对于这种题时题意似懂非懂的，这题第一次我以为是排序，但后面百度了才知道，这题压根就不排序，就是最小子序列的和大于或等于S的值，一般方法是会超时的，但应该可以优化的，不过这题可以用二分的思想做，二分对于我这种渣渣来说是很难理解的，思想总是很简单，但是实践起来就不一样了，下面这个是我参考了网上的代码，写出来的。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
int num[100005],str[100005];
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int n,m,left,right,ans;
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;i++)
		scanf("%d",&num[i]);
		str[0]=0;
		for(int i=1;i<=n;i++)
		{
			str[i]=str[i-1]+num[i];//求出num前i个的和 
		}
		ans=n+1;
		for(int i=n;i>=1;i--)
		{
			int s1=str[i]-m;//总的和减去m的值 
			if(s1<0)//不满足条件的话，不进行下面的操作			 
			continue;
		    int L=0,R=i;//二分思想 
		    while(L<R)
		    {
		    	int M=(L+R)/2+1;//求出中点 
				if (str[M]<=s1) 
				L=M;
				else
				R=M-1; 
			}
			ans=min(ans,i-L); 
		}
		if(ans==n+1)
		printf("0\n");
		else
		printf("%d\n",ans);
		
	}
	return 0;
}