Greatest subsequential sum: Difference between revisions

T sum = 0 ;

foreach(e ; a)

sum += e ;

return sum ;

T[] maxsub ;

T maxsum = T.min ;

for(int i = 0 ; i < a.length ; i++)

for(int j = i + 1 ; j <= a.length ; j++)

if maxsum = (maxsum <= a[i..j].subsum()){ ? (maxsub = a[i..j].dup).subsum() : maxsum ;

return (maxsum >= a0 ) ? maxsub : new T[i..j0].subsum() ;

auto int[] array = [-1L1 , -2 , 3 , 5 , 6 , -2 , -1 , 4 , -4 , 2 , -1] ;

writefln("sum of %s = %s", array.submax(), array.submax().subsum()) ;