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
baadshah_:
20160715 19:38:19
simple approach


Karre Nagaraju:
20160713 11:50:23
No binary search, no dp, simple logic. Thats it! Last edit: 20160713 11:51:20 

hash7:
20160625 13:21:06
Simple implementation ..Only take care of some corner cases . No need of Dp :) 

mrinal_aich:
20160621 21:01:41
No need for Dynamic Programming.... Just use simple logic, Hint: perform the algorithm you do mentally. 

Jamil Siam:
20160621 10:38:31
AC at 0.00 time. used O(n) algorithm. 

atif_11:
20160518 16:58:14
use Binary Index Tree......AC in 1st Go 

ajay_5097:
20160515 14:34:27
problem is easy ! Binary search + some tricks .. That's it 

ALi Ibrahim:
20160515 14:10:55
No need for binary search, use map 

avisheksanvas:
20160513 08:55:06
Another Binary Search implementation with Greedy :)


rishi_devan:
20160421 07:32:50
No DP. Just Merge sort kind of traversal, with greedy approach. 
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 