human
Maximum Sum Subsequence | Function to print the maximum non - emepty subsequence sum.
Stores the maximum non - emepty subsequence sum in an array.
Stores the largest element in the array.
Traverse the array.
If a [ i ] is greater than 0.
Update sum.
Driver Code"
Solution in Python:

What is a code to maximum Sum Subsequence and the other steps required?
assistant
#Here is code to maximum Sum Subsequence and the other steps required.
 def MaxNonEmpSubSeq ( a , n ) :
	sum = 0
	maxm = max ( a )
	if ( maxm <= 0 ) :
		return maxm
	for i in range ( n ) :
		if ( a [ i ] > 0 ) :
			sum += a [ i ]
	return sum
if __name__ == ' _ _ main _ _ ' :
	arr = [ - 2 , 11 , - 4 , 2 , - 3 , - 10 ]
	N = len ( arr )
	print ( MaxNonEmpSubSeq ( arr , N ) )