Editing Maximum subvector sum

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 14: Line 14:
  
 
===Implementation (C++)===
 
===Implementation (C++)===
This snippet is a direct translation of the algorithm given in the text:
 
<syntaxhighlight lang="cpp">
 
template<class Vector>
 
int max_subvector_sum(Vector V)
 
{
 
    int* M = new int[V.size() + 1];        // dynamically allocate array M
 
    M[0] = 0;
 
    for (int i = 0; i < V.size(); i++)
 
        M[i+1] = V[i] + max(0, M[i]);      // apply the formula, but with zero-indexed arrays
 
    int res = max_element(M, M+V.size()+1);
 
    delete[] M;
 
    return res;
 
}
 
</syntaxhighlight>
 
With a bit of thought, this can be simplified. In particular, we don't need to keep the entire array <math>M</math>; we only need to remember the last element computed.
 
 
<syntaxhighlight lang="cpp">
 
<syntaxhighlight lang="cpp">
 
template<class Vector>
 
template<class Vector>

Please note that all contributions to PEGWiki are considered to be released under the Attribution 3.0 Unported (see PEGWiki:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!

Cancel | Editing help (opens in new window)

Templates used on this page: