## CCC '96 S5 - Maximum Distance

View as PDF

Points: 10
Time limit: 2.0s
Memory limit: 16M

Problem type

Consider two descending sequences of integers and with and and for all , . The distance between two elements and is given by

if and , or otherwise

The distance between sequence and sequence is defined by

You may assume .

For example, for the sequences and below, their maximum distance is reached for and , so .

           i=2
|
v
X     8  8  4  4  4  3  3  3  1
Y     9  9  8  8  6  5  5  4  3
^
|
j=7

#### Sample Input

2
9
8 8 4 4 4 3 3 3 1
9 9 8 8 6 5 5 4 3
7
6 5 4 4 4 4 4
3 3 3 3 3 3 3

#### Sample Output

The maximum distance is 5
The maximum distance is 0

• Arihan10  commented on Feb. 17, 2019, 1:31 p.m. edited

For anyone who doesn't understand this problem, you have to basically find the maximum distance between two values in the arrays given n times.

On line 1, there is a single integer n.

1. On the next line: Another integer l.
2. The next 2 lines contain two separate arrays of l integers.

Repeat steps 1 & 2 n times.

Hope this helps you understand the problem a bit better.

• Arihan10  commented on Feb. 3, 2019, 12:31 a.m. edit 2

Can someone help me understand this a bit better?

• 1yangdan  commented on Dec. 28, 2017, 9:17 p.m.

why is this brute force question worthing 10 points?

• Roynaruto  commented on Dec. 30, 2017, 2:24 a.m.

I think it was that teachers actually marked the CCC before, so they had to manually input everything instead of having generated test cases. RIP teachers. They probably wanted to make it look scary.

• jkguipqnjcy49979693  commented on Dec. 29, 2017, 9:43 p.m. edited

I binary searched by successive submissions and it seems like

[Computers were probably too slow in 1996 but...]

• abcConjecture  commented on Jan. 7, 2018, 8:38 p.m.

Yeah... the test cases seem a bit weak. The same problem on PEG has but I don't think a brute force approach passes due to the addition of more cases.