Pro.ID22048 TitleSequence Title链接http://10.20.2.8/oj/exercise/problem?problem_id=22048 AC0 Submit11 Ratio0.00% 时间&空间限制描述Given a sequence S of n numbers and two length bounds L and U. Your task is to write a program to find a segment S[i], S[i+1], … , S[j] with minimum sum over all segments of S with length at least L and at most U. 输入The input consists of multiple datasets. The end of the input is indicated by a line containing a zero. The format of each dataset is as follows. n L U S1 S2 … Sn Here , all data items are positive integers. n is the length of the sequence ( n ≤ 32767 ). L and U are two length bounds where L ≤ U. S1, S2, … , Sn are the sequence of n numbers. 输出Description Given a sequence S of n numbers and two length bounds L and U. Your task is to write a program to find a segment S[i], S[i+1], … , S[j] with minimum sum over all segments of S with length at least L and at most U. Input The input consists of multiple datasets. The end of the input is indicated by a line containing a zero. The format of each dataset is as follows. n L U S1 S2 … Sn Here , all data items are positive integers. n is the length of the sequence ( n ≤ 32767 ). L and U are two length bounds where L ≤ U. S1, S2, … , Sn are the sequence of n numbers. Output For each dataset, output the minimum sum of segment, in a separate line. Sample Input 9 Sample Output -5 Hint the segment is -4 1 -2 Source 样例输入9 样例输出-5 提示the segment is -4 1 -2 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-4 07:59 , Processed in 0.034491 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
