woj-1301
来源:互联网 发布:java大学简明教程下载 编辑:程序博客网 时间:2024/04/27 17:36
Problem 1301 - Subsequence
Time Limit: 1000MS Memory Limit: 65536KB Difficulty: 3
Total Submit: 1201 Accepted: 547 Special Judge: No
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
Hint
Source
Southeastern Europe 2006
#include<stdio.h>#define max 100000int answer(int array[], int n, int sum){ int temp = 0; int i = 0; int j = i; int len = n; while (j < n) { while (temp < sum) { temp += array[j]; ++j; if (j >= n) break; } if (temp < sum) return len; while (temp >= sum) { temp -= array[i]; ++i; //if (i >= j) break; } if (len > j - i + 1) len = j - i + 1; } return len;}int main(){ int T; int n, array[max], sum; int sum_array = 0; scanf("%d", &T); while (T > 0) { scanf("%d%d", &n, &sum); for (int i = 0; i < n; ++i) { scanf("%d", &array[i]); sum_array += array[i]; } if (sum_array < sum) printf("0\n"); else printf("%d\n", answer(array, n, sum)); sum_array = 0; --T; } return 0;}
- woj-1301
- WOJ
- woj
- WOJ 1020
- WOJ 1014
- WOJ 1055
- WOJ-1402
- WOJ--1314
- WOJ-1315
- WOJ-1316
- WOJ-1100
- WOJ-1167
- WOJ 1619
- woj 1538
- WOJ1416-WOJ
- WOJ-1002
- WOJ-1003
- WOJ 1011
- 没有JPEGEncoderOptions的解决方法
- 线性表
- volatile和explicit
- cocos2dx编译android游戏中,我踩过的坑_2
- iOS学习第八篇 ——NSString的使用
- woj-1301
- leetcode 33 : Search in Rotated Sorted Array
- 论文提要“Hypercolumns for Object Segmentation and Fine-grained Localization”
- [华为机试] 最高分是多少
- Jquery easyui combotree清除选中扩展
- JAVA问题总结之11-运算符注意事项
- android
- sass 使用 css预编译
- 算法学习