ANARC05B  The Double HeLiX
Two ﬁnite, 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:
 You may start at the beginning of any of the two sequences. Now start moving forward.
 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 ﬁnding 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 speciﬁed on two separate lines. Each line denotes a sequence and is speciﬁed 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
hide comments
sagnik_66:
20170601 16:17:51
Applied Greedy to this! 

nermatibhanu:
20170530 17:12:44
No need of dp done with O (n+m) complexity 

prachi_1:
20170523 12:39:21
Answer for this and logic?


prabodh prakash:
20170507 22:59:21
Solved. Simple logic. Binary search will only improve complexity. Also, this is not a dynamic programming question. This is a greedy algorithm question. 

harshit2202:
20170412 07:03:10
No binary search!! No dp!! Simple logic 

sunny:
20170331 13:35:12
simple one. 

shubh_01:
20170326 07:34:51
getting segmentation fault .good running on ideone. 

codeappy:
20170315 07:47:18
Good Problem. Go for binary search. No dp needed. 

vineetpratik:
20170308 10:45:11
easy one no need to sort,binary,search dp can be solved like adhoc.


matomas:
20170305 15:04:03
Shouldn't the correct output for this input be 50 rather than 30?

Added by:  ~!(*(@*!@^& 
Date:  20090705 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ANARC 2005 