提供了编程的基础技术教程

zl程序教程

您现在的位置是：首页 >  后端

当前栏目

A - Subsequence （算法 二分 ）

算法 二分 Subsequence
2023-09-11 14:22:48 时间

点击打开链接



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





#include<stdio.h>#include<algorithm>#define MAX 100000using namespace std;int main(){int u;int sum[MAX+22];int ans;int n,s;scanf("%d",&u);while(u--){scanf("%d %d",&n,&s);scanf("%d",&sum[0]); //注意这个地方 for(int i=1; i<n; i++){scanf("%d",&sum[i]);sum[i]+=sum[i-1]; } if(sum[n-1]<s) { printf("0\n"); continue; } ans =n; int pos; for(int i=n-1; i>=0; i--) { if(sum[i]<s) break; pos=upper_bound(sum,sum+n,sum[i]-s)-sum; ans=min(ans,i-pos+1); } printf("%d\n",ans); } return 0;}



相关文章