zoj 3123

Run ID	Submit Time	Judge Status	Problem ID	Language	Run Time(ms)	Run Memory(KB)	User Name
2009188	2009-10-05 08:56:30	Accepted	3123	C++	130	576	solidfish
2009187	2009-10-05 08:54:46	Accepted	3123	C	40	160	solidfish

 使用CIO的效果。

2009190

2009-10-05 09:00:13

Accepted

3123

C++

40

576

solidfish

 开辟一个大数组。

Run ID	Submit Time	Judge Status	Problem ID	Language	Run Time(ms)	Run Memory(KB)	User Name
2009193	2009-10-05 09:04:54	Accepted	3123	C++	40	184	solidfish

 

 

Subsequence

---

Time Limit: 1 Second      Memory Limit: 32768 KB

---

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

//3123 #include <iostream> using namespace std; int main() { int t; int a[100000]; while(scanf("%d",&t)!=EOF) { while(t--) { int n,s; //cin>>n>>s; scanf("%d %d",&n,&s); //int *a = new int[n]; for( int i = 0 ; i < n; i++) //cin>>a[i]; scanf("%d",a+i); int sum = 0; int j = 0 , k = 0; int ml = n; for (;k<n||sum>=s;) { if (sum>=s) { sum-=a[j]; j++; if (k-j+1<ml) ml=k-j+1; } else { sum+=a[k]; k++; } } //delete a; if(j==0) //cout<<0<<endl; printf("0/n"); else //cout<<ml<<endl; printf("%d/n",ml); } } return 0; }