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
shubham2305:
20160929 18:21:00
no binary search required in fact no dp too.


alaa_alrayes96:
20160927 16:09:27
binary search + 2 array check TC of Krishna AC 4 1 2 3 4


ajeyo:
20160908 13:28:34
No dp! :P


sonu:
20160831 13:29:07
seriously why is this question even tagged dp?? 

Sumit :
20160831 08:49:30
I've tried all the test cases present in the comments till Page9 and java code is giving correct output. I am Still getting WA.


love11mishra:
20160829 11:42:11
ya :) very simple conceptually but a little stuff needed to implement !


manish3749:
20160819 20:51:43
accepted in one go ☻☻☻☺


tebnine:
20160818 22:20:01
what happens if there is more than one intersection with the same value like this :


sakshi:
20160806 12:30:18
Nice question!! 

sieunhanbom04:
20160803 11:53:48
if someone uses "mergesort" like approach with sentinel, maybe this test can help you (in case you got WA):

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 