投資錢景>買台積電就對了工程師靠存股年領百萬股息吉隆坡最便宜行程一覽表反服貿流血 法官要警交...
2011-12-16 17:31:48 人氣(154) | 回應(0) | 推薦(0) | 收藏(0) 上一篇 | 下一篇

[UVA] 1121 - Subsequence

0
收藏
0
推薦

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 

Many test cases will be given. 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 there isn't such a subsequence, print 0 on a line by itself.

 

Sample Input 

 

10 15 
5 1 3 5 10 7 4 9 2 8 
5 11 
1 2 3 4 5

 

Sample Output 

 

2 
3



題目 : 找一段長度(連續)最小的總和大於等於指定值
作法 : O(n)

#include<stdio.h>
int main() {
    int N, S, A[100000], i;
    while(scanf("%d %d", &N, &S) == 2) {
        for(i = 0; i < N; i++)
            scanf("%d", &A[i]);
        int tail = -1, sum = 0;
        int min = 0xfffffff;
        for(i = 0; i < N; i++) {
            while(sum < S && tail+1 < N)
                sum += A[++tail];
            if(min > tail - i && sum >= S)
                min = tail - i;
            sum -= A[i];
        }
        if(min == 0xfffffff)    puts("0");
        else        printf("%d\n", min+1);
    }
    return 0;
}

1121Subsequence
台長:Morris
人氣(154) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA] 10789 - Prime Frequency
此分類上一篇:[UVA] 1266 - Magic Square

我要回應
是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入以下數字 (ex:123)

(有*為必填)
詳全文