Time Limit: 1000MS | Memory Limit: 65536KB | 64bit IO Format: %lld & %llu |
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
标准的尺取法
尺子大致就是这样的 首先 初始是为0 的 之后 一个值记录区间的开始 另外一个值记录区间的扩张 当满足条件的时候 在让起始的值向后面移动。然后记录有效区间 留下最小的
用这个方法复杂度降到了o(n)。
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
long long d[200000],a[200000];
int main()
{
long long t;
cin>>t;
while(t--)
{
long long n,m;
cin>>n>>m;
for(long long i=0;i<n;i++)
cin>>a[i];
long long s=0;
long long l=0,r=0;
long long minsum=100000000;
while(1)
{
while(r<n&&s<m)
{
s+=a[r];
// cout<<a[r]<<' ';
r++;
}//cout<<" "<<s<<endl;
if(s<m) break;
while(s-a[l]>=m)
{
s-=a[l];
l++;
}
if(s>=m)
{
minsum=min(minsum,r-l);
}
s-=a[l];l++;
//cout<<s<<' '<<m<<endl;
}
if(minsum<100000000)
cout<<minsum<<endl;
else cout<<"0"<<endl;
}
}