Given an array X of N real numbers we would like to find the maximum sum of entries found in any subarray of X$.$ For instance, if N $=10$ and X$[1.\mathrm{.}10]$ is

$1$

$2$

$3$

$4$

$5$

$6$

$7$

$8$

$9$

$10$

$31$

$-41$

$59$

$26$

$-53$

$58$

$97$

$-93$

$-23$

$84$

then the answer is $187,$