PHP Exercises: Find the maximum sum of a contiguous subsequence from a given sequence of numbers a1, a2, a3, ... an

PHP: Exercise-57 with Solution

Write a PHP program to find the maximum sum of a contiguous subsequence from a given sequence of numbers a1, a2, a3, ... an. A subsequence of one element is also a continuous subsequence.

Input:You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
Input numbers are separated by a space.
Input 0 to exit.

Pictorial Presentation:

Sample Solution: -

PHP Code:

<?php
while($line = fgets(STDIN)){
	$n = intval($line);
	if($n == 0){
		break;
	}	
	$arr = array();
	$max_val = array();
	for($i = 0; $i < $n; $i++){
		$x = intval(fgets(STDIN));
		$arr[$i] = 0;
		$max_val[$i] = -1000000;
		for($j = 0; $j <= $i; $j++){
			$arr[$j] += $x;
			if($max_val[$j] < $arr[$j]){
				$max_val[$j] = $arr[$j];
			}
		}
	}
	
	echo max($max_val)."\n";
}
?>

Sample Input:
6
-4
-2
5
3
8

Sample Output:

16

Flowchart:

PHP Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a PHP program to test whether two lines PQ and RS are parallel.
The four points are P(x1, y1), Q(x2, y2), R(x3, y3), S(x4, y4).
Next: Write a PHP program to test the specified Circumference of C1 and C2 intersect.