ANARC05B - The Double HeLiX

Two finite, strictly increasing, integer sequences are given. Any common integer between the two sequences constitute an intersection point. Take for example the following two sequences where intersection points are
printed in bold:

  • First= 3 5 7 9 20 25 30 40 55 56 57 60 62
  • Second= 1 4 7 11 14 25 44 47 55 57 100

You can ‘walk” over these two sequences in the following way:

  1. You may start at the beginning of any of the two sequences. Now start moving forward.
  2. At each intersection point, you have the choice of either continuing with the same sequence you’re currently on, or switching to the other sequence.

The objective is finding a path that produces the maximum sum of data you walked over. In the above example, the largest possible sum is 450, which is the result of adding 3, 5, 7, 9, 20, 25, 44, 47, 55, 56, 57, 60, and 62

Input

Your program will be tested on a number of test cases. Each test case will be specified on two separate lines. Each line denotes a sequence and is specified using the following format:

n v1 v2 ... vn

Where n is the length of the sequence and vi is the ith element in that sequence. Each sequence will have at least one element but no more than 10,000. All elements are between -10,000 and 10,000 (inclusive).
The last line of the input includes a single zero, which is not part of the test cases.

Output

For each test case, write on a separate line, the largest possible sum that can be produced.

Sample

Input:
13 3 5 7 9 20 25 30 40 55 56 57 60 62
11 1 4 7 11 14 25 44 47 55 57 100
4 -5 100 1000 1005
3 -12 1000 1001
0

Output:
450
2100

Added by:psetter
Date:2009-07-05
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:ANARC 2005

hide comments
2014-07-13 21:46:49 Ayur Jain
No DP required
2014-06-28 23:54:47 Naruto uzumaki
half century :)
2014-06-19 04:36:24 Θ
Try these cases:
input

5 1 3 5 7 9
5 2 4 6 8 10
5 1 2 3 4 5
6 1 2 3 4 5 6
0
output

30
21
2014-06-11 16:53:44 मोहन
My 50th........... :D
2014-06-05 20:05:58 Archit Jain
<snip>
plz someone help
whats wrong with this code working for all
test cases

Last edit: 2023-05-28 23:05:24
2014-05-31 14:33:45 Manish Jindal
i think values are >10000 or <-10000 i was getting WA because of this please check...
i increase size to 11000 and got accepted..
2014-05-21 20:05:12 agaurav77
Nice question. Requires thought but once you get the trick, it's simple!! No extra optimizations for C, I suppose. More test cases-
10 1 5 66 78 99 103 222 334 888 899
12 1 2 3 66 69 99 103 555 558 888 889 899
3 1 3 4
7 1 2 3 4 5 6 7
0

gives

4141
28
2014-05-16 13:55:04 Dharmesh Ruprela
Can be easily solved without DP.Simple Logic :)
2014-04-16 14:12:58 Sandy
nice problem. got ac in first attempt but took some time to think
2014-04-14 07:47:31 Tarun Garg
DP rox
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.