Home/ Questions/Q 451091
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-12T21:56:02+00:00

Given an array of integers, how can you find two indices, i and j,

  • 0

Given an array of integers, how can you find two indices, i and j, such that the sum of the elements in the subarray starting and ending at the indices is maximized, in linear time?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    from my copy of programming pearls:

    maxsofar = 0
maxendinghere = 0
for i = [0, n)
    /* invariant: maxendinghere and maxsofar are accurate
       are accurate for x[0..i-1] */
    maxendinghere = max(maxendinghere + x[i], 0)
    maxsofar = max(maxsofar, maxendinghere)
    • 0