human
Maximum profit by selling N items at two markets | Function to calculate max profit.
Prefix sum array for profitA [ ].
Suffix sum array for profitB [ ].
If all the items are sold in market A.
Find the maximum profit when the first i items are sold in market A and the rest of the items are sold in market B for all possible values of i.
If all the items are sold in market B.
Driver code.
Function to calculate max profit"
How can the above be solved in Python?
 ... Give me a code to maximum profit by selling N items at two markets and the other steps required?
assistant
#Here is code to maximum profit by selling N items at two markets and the other steps required.
 def maxProfit ( profitA , profitB , n ) :
	preSum = [ 0 ] * n ;
	preSum [ 0 ] = profitA [ 0 ] ;
	for i in range ( 1 , n ) :
		preSum [ i ] = preSum [ i - 1 ] + profitA [ i ] ;
	suffSum = [ 0 ] * n ;
	suffSum [ n - 1 ] = profitB [ n - 1 ] ;
	for i in range ( n - 2 , - 1 , - 1 ) :
		suffSum [ i ] = suffSum [ i + 1 ] + profitB [ i ] ;
	res = preSum [ n - 1 ] ;
	for i in range ( 1 , n - 1 ) :
		res = max ( res , preSum [ i ] + suffSum [ i + 1 ] ) ;
	res = max ( res , suffSum [ 0 ] ) ;
	return res ;
if __name__ == " _ _ main _ _ " :
	profitA = [ 2 , 3 , 2 ] ;
	profitB = [ 10 , 30 , 40 ] ;
	n = len ( profitA ) ;
	print ( maxProfit ( profitA , profitB , n ) ) ;