KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
For example, given A = [1,51,3,1,100,199,3], maxSum = 51 + 1 + 199 = 251. clearly max(oddIndexSum,evenIndexSum) does not work. The main problem I have is that I can't come up with a selection criterion for an element. A rejection criterion is trivial given a selection criterion. The standard maximum sub-sequence algorithm doesn't seem to be applicable here. I have tried a dynamic programming approach, but can't come up with that either. The only approach I could come up with was one that used a genetic algorithm. How would you approach this?
Tags (comma-separated)
Save Edits
Cancel