StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
15198176
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-03-04T09:22:26.740
FavoriteCount
0
LastActivityDate
2013-03-04T09:27:42.287
LastEditDate
2013-03-04T09:27:42.287
LastEditorUserId
1009831
OwnerUserId
1009831
ParentId
15193469
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
Maximum sum may be found using a dynamic programming algorithm. Scan the array and for each element add its value to the largest sub-sequence sum which is valid (sub-sequence ends with a value not greater than this element). Efficient implementation needs some way to quickly find maximum value in given sub-range. Augmented binary search tree may be used to do it. Fenwick tree is just an efficient implementation of augmented binary search tree. Most common use of Fenwick tree is to find a sum of values in some sub-range. Trivial modification allows to use it to find sub-range maximum (this works because in this particular case values in the Fenwick tree are never decreased). See this Python code for details: <pre class="lang-py prettyprint-override"><code>array = [1, 4, 4, 2, 2, 3, 3, 1] numbers = sorted(set(array)) n = len(numbers) indexes = {numbers[v]:v+1 for v in range(0, n)} n += 1 bit = [0] * n result = 0 for x in array: pos = indexes[x] i = pos maximum = 0 while i != 0: maximum = max(maximum, bit[i]) i = i & (i-1) x += maximum i = pos while i < n: bit[i] = max(bit[i], x) i += i & -i result = max(result, x) print(result) </code></pre> <code>indexes</code> dictionary is used to decrease size of Fenwick tree from the largest number in the input array to the array's size. First nested <code>while</code> finds sub-range maximum in Fenwick tree. Second nested <code>while</code> updates Fenwick tree after one of the sums is updated. This code works only for an array of positive numbers. In general case input array should be pre-processed by filtering out all non-positive numbers. Time complexity is O(N log N). Space complexity is O(N).
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POMaximum Sum of a non decreasing sub-sequence in an array using fenwick tree or BIT
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USEvgeny Kluev
UserOwnerUserId
1. USEvgeny Kluev
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POMaximum Sum of a non decreasing sub-sequence in an array using fenwick tree or BIT
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.