Longest Sequence
Statement
Goal
The input data contains sorted unique numeric values. A continuous sequence is a sequence where each value is exactly 1 higher than the previous one, such asInput
Line 1: An integer N for the number of input values.
Line 2: N input values X separated by space.
Line 2: N input values X separated by space.
Output
Line 1: MIN MAX - min and max values separated by space
Constraints
1 <= N <= 100
-10000 <= X <= 10000
-10000 <= X <= 10000
Example
Input
6 1 2 3 4 5 6
Output
1 6
Game modes
Fastest, Shortest, Reverse
Test cases
Simple Test
Input
6
1 2 3 4 5 6
Output
1 6
Validator 1 Validator
Input
6
2 3 4 5 6 7
Output
2 7
Two Sequences Test
Input
11
10 11 12 13 14 17 18 19 20 21 22
Output
17 22
Validator 2 Validator
Input
11
9 10 11 12 13 18 19 20 21 22 23
Output
18 23
Same Length Test
Input
9
5 6 7 99 100 101 853 854 855
Output
5 7
Validator 3 Validator
Input
11
5 6 7 8 99 100 101 102 854 855 856
Output
5 8
Negative Test
Input
16
-12 -11 -10 -9 -8 -5 -3 -2 -1 0 1 2 23 24 25 26
Output
-3 2
Validator 4 Validator
Input
17
-12 -11 -10 -9 -8 -7 -6 -5 -3 -2 -1 0 1 2 3 4 5
Output
-3 5
Smallest Test
Input
1
42
Output
42 42
Validator 5 Validator
Input
1
69
Output
69 69
Discontinuous Test
Input
5
-1526 -62 0 15 9654
Output
-1526 -1526
Validator 6 Validator
Input
5
-2540 -62 0 15 9654
Output
-2540 -2540
Biggest Test
Input
37
-101 -100 -99 -98 -97 -96 -95 -94 -93 -52 -1 0 1 2 3 4 5 6 7 12 13 14 15 16 62 63 64 65 67 68 69 70 71 999 1000 1001 1002
Output
-101 -93
Validator 7 Validator
Input
37
-100 -99 -98 -97 -96 -95 -94 -93 -92 -52 -1 0 1 2 3 4 5 6 7 12 13 14 15 16 62 63 64 65 67 68 69 70 71 999 1000 1001 1002
Output
-100 -92
Solution language
Solution
Stub generator input