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
pithoriya:
20180217 10:35:51
SpojToolkit give the wrong answer for the test case


sebastiamestre:
20180122 05:40:04
just a sliding window and a (admittedly adhoc) greedy in O(N+M) :) easy PZ 

ameyanator:
20180119 14:27:19
Not really DP neither Binary Search :P. More like adhoc 

v_pp_27:
20180115 15:24:21
lower_bound and this test case helped ...


snor_lax13:
20180102 18:43:42
EZ...how is this even DP? Last edit: 20180102 18:59:52 

codhek_09:
20171227 21:43:45
getting runtime error even though the given test cases work :/ 

devansh1497:
20171218 17:24:34
Ah I was accessing the wrong array which led to 45 Runtime errors...I used Binary search and memoization.


sajal_tikariha:
20171212 11:57:09
Solved in O(m+n) complexity. Last edit: 20171212 12:25:18 

ishgen:
20170927 08:35:27
I am getting NZEC if I solve this problem using java.Code is working fine in eclipse and ideone.Does anyone has any idea about it? 

kholan:
20170910 15:03:04
Damn indices did switch 1 i for an j and there it goes NZEC 
Added by:  ~!(*(@*!@^& 
Date:  20090705 
Time limit:  0.130s0.686s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ANARC 2005 