ANARC05B - The Double HeLiX
Two finite, 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 finding 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 specified on two separate lines. Each line denotes a sequence and is specified 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
hot:
2012-09-26 17:35:26
working well on all cases i have checked but still giving WA, any one plz provide some tricky test cases ..soon |
|
hot:
2012-09-26 17:26:44
working gd on all test cases i hve checked yet giving wa..
|
|
Code Maestro:
2011-09-11 19:36:23
Final EDIT: Just be careful with negative numbers if your methods tend to be peculiar :P Last edit: 2011-09-11 21:07:55 |
|
kapil:
2010-10-08 21:30:11
4 1 2 3 4
|
|
hendrik:
2010-06-25 09:28:19
TXT solution?!!? Shouldnt be there. |
|
The Bartender:
2010-05-23 13:05:14
@Roman Gonzalez
|
|
Alexander Tolstov:
2010-03-27 10:55:02
there is strange problem with Java... Many java solutions got Runtime Error, but the same c++ solution got ac... |
|
Jacob:
2010-01-20 14:16:02
this one gave me loads of jip using stringstreams because of extra whitespace in the input and different behaviour on the judge machine. need more input verification than most problems |
|
Roman:
2009-11-20 06:25:03
Careful with the white spaces on the input... it costed me 3 RE |
|
Richard Cocks:
2009-11-13 20:25:47
Problem states that sequences are strictly increasing. This prevents any cycling. |
Added by: | psetter |
Date: | 2009-07-05 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | ANARC 2005 |