码迷,mamicode.com
首页 > 其他好文 > 详细

[POJ 3061] Subsequence

时间:2015-06-30 21:47:37      阅读:121      评论:0      收藏:0      [点我收藏+]

标签:

Subsequence
TL: 1s, ML: 32Mb

Description

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

Source

【题解】

尺取法应用第二弹,随便搞都能A系列

技术分享
 1 #include<stdio.h>
 2 using namespace std;
 3 int testc,n,S,a[100010],rr;
 4 int main() {
 5     scanf("%d",&testc);
 6     while(testc--) {
 7         scanf("%d%d",&n,&S);rr=n+1;
 8         for (int i=0;i<n;++i) scanf("%d",&a[i]);
 9         int s=0,t=0,ns=0;
10         for (;;) {
11             while(t<n&&ns<S) ns+=a[t++];
12             if(ns<S) break;
13             if(t-s<rr) rr=t-s;
14             ns-=a[s++];
15         }
16         if(rr>n) rr=0;
17         printf("%d\n",rr);
18     }
19 }
View Code

 

[POJ 3061] Subsequence

标签:

原文地址:http://www.cnblogs.com/TonyNeal/p/poj3061.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!