【ACM菜逼解题报告】Subsequence

最新推荐文章于 2019-04-11 16:11:59 发布

「已注销」

最新推荐文章于 2019-04-11 16:11:59 发布

阅读量350

点赞数

CC 4.0 BY-SA版权

分类专栏：菜逼解题报告文章标签： acm

本文链接：https://blog.youkuaiyun.com/yzxin95/article/details/43568133

菜逼解题报告专栏收录该内容

21 篇文章

订阅专栏

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

Many test cases will be given. 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 there isn't such a subsequence, print 0 on a line by itself.

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

Sample Output
2
3

二分子序列的长度，二分性质就不用证明了吧，很显然的一件事情。

附代码如下：

#include<cstdio> 

using namespace std;

#define MAXN (100000+5)

int sum[MAXN];
int n,s;

bool check(int x){
	for(int i=x;i<=n;i++){
		if(sum[i]-sum[i-x]>=s)return true;
	}
	return false;
}

int main(){
	while(scanf("%d%d",&n,&s)!=EOF){
		sum[0]=0;
		for(int i=1;i<=n;i++){
			int x;
			scanf("%d",&x);
			sum[i]=sum[i-1]+x;
		}
		int L=0,R=n+1;
		while(L<R){
			int MID=((L+R)>>1);
			if(check(MID))R=MID;
				else L=MID+1;
		}
		if(R==n+1)L=0;
		printf("%d\n",L);
	}
	return 0;
}