Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie
Hi there,
There is an issue with role permissions that is being worked on at the moment.
If you are having trouble with access or permissions on regional forums please post here to get access: https://www.boards.ie/discussion/2058365403/you-do-not-have-permission-for-that#latest

Finding the largest sub vector in a sequence

  • 14-09-2009 10:52am
    #1
    Registered Users, Registered Users 2 Posts: 46


    Hi folks,
    I need to find the largest sub-vector from a sequence of integers, both positive and negative. For example:

    6,94,-63,-41,20,5,-61,83,-14,-50,
    36,30,32,51,96,72,99,23,-59,-23,
    The largest sub vector here is
    6,94,-63,-41,20,5,-61,83,-14,-50,
    36,30,32,51,96,72,99,23,-59,-23,

    Any ideas?
    Is there an algorithim that will do this?
    Cheers


Comments

  • Registered Users, Registered Users 2 Posts: 2,164 ✭✭✭cavedave


    This is called the largest subsequence problem. There is stuff on it here and here. Both these seem to use dynamic programming.


Advertisement