Escreva um programa eficiente para encontrar a soma da subarray contígua dentro de uma array unidimensional de números que possui a maior soma.

<?php
// PHP program to print largest
// contiguous array sum
  
function maxSubArraySum($a, $size)
{
    $max_so_far = PHP_INT_MIN; 
    $max_ending_here = 0;
  
    for ($i = 0; $i < $size; $i++)
    {
        $max_ending_here = $max_ending_here + $a[$i];
        if ($max_so_far < $max_ending_here)
            $max_so_far = $max_ending_here;
  
        if ($max_ending_here < 0)
            $max_ending_here = 0;
    }
    return $max_so_far;
}
  
// Driver code
$a = array(-2, -3, 4, -1,
           -2, 1, 5, -3);
$n = count($a);
$max_sum = maxSubArraySum($a, $n);
echo "Maximum contiguous sum is ", 
                          $max_sum;
  
// This code is contributed by anuj_67.
?>

<?php 
function maxSubArraySum(&$a, $size)
{
$max_so_far = 0;
$max_ending_here = 0;
for ($i = 0; $i < $size; $i++)
{
    $max_ending_here = $max_ending_here + $a[$i];
    if ($max_ending_here < 0)
        $max_ending_here = 0;
  
    /* Do not compare for all elements. 
       Compare only when max_ending_here > 0 */
    else if ($max_so_far < $max_ending_here)
        $max_so_far = $max_ending_here;
}
return $max_so_far;
  
// This code is contributed
// by ChitraNayal
?>

Artigo contribuído por:

GeeksforGeeks

Vote na dificuldade

<button class="btn" data-gfg-action="article-difficulty" data-rating="1">Fácil</button> <button class="btn" data-gfg-action="article-difficulty" data-rating="2">Normal</button> <button class="btn" data-gfg-action="article-difficulty" data-rating="3">Médio</button> <button class="btn" data-gfg-action="article-difficulty" data-rating="4">Duro</button> <button class="btn" data-gfg-action="article-difficulty" data-rating="5">Especialista</button>

Tags de artigo:

• Programas PHP

Reportar problema