Maximum value contigous sub sequence. need to give all test cases
Sigiloso
int maxSumSubSequence( int a[] ) { int maxSum = a[0]; int currentSum = 0; int alen = sizeof(a)/sizeof(a[0]); for( int i = 0; i maxSum ) { maxSum = currentSum ; } if( currentSum < 0 ) { currentSum = 0; } } return maxSum; }