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
swastik_sahoo:
20191208 14:09:31
use two pointer method. 

killer_knight:
20191003 15:38:51
make sure to change index accordingly while switching from one sequence to another in dp using binary search..:) 

thesyncoder:
20190713 20:35:52
Guys just do prefix sum , and lower_bound . : ) 

saurav_paul:
20190529 08:26:46
Accepted in one go,


syed_tanveer:
20190405 09:28:12
Binary Search + prefix Sum + greedy, easy one. 

maratha:
20190324 18:33:56
DP here actually gives maximum answer. 

suraj_13:
20190112 18:36:23
@adityad1998


suraj_13:
20190112 18:35:15
greedy + binary search + prefix sum array 

sophozaar:
20181209 17:18:12
@adityad1998, perfect hint :P


lamia2658:
20181127 16:27:35
can be done easily with greedy and set_intersection()

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 