Alice wants to buy a stock. She knows the increase and decrease in the stock value for N consecutive days. Positive value denotes the increase in stock price and negative value denotes the decrease in stock price.
She can buy stock in the morning, the increment or decrement in the stock occurs in afternoon and the selling can be done only at night. She can buy and sell stock at most once.
She can choose not to buy stock at all. Selling is only possible if she has bought the stock before. You can safely assume that she buys the stock at the price 0 units at any particular day.
You have to calculate the maximum profit she can earn.
Input Format:
First line of the input contains an integer N denoting the number of days.
Next line contains N space separated integers denoting increase or decrease in value. (Positive number denotes increase and negative denotes decrease)
Output Format:
Maximum profit that can be earned in this trade.
Constraints :
- \(1 \le N \le 10^{5}\)
- \(-10^{5} \le A_{i} \le 10^{5}\)
Alice buys stock on day 2 morning . Initial value of stock is 0 ,
On day 2 , it increase by 2 ,so it's value becomes 2
On day 3 , it increase by 3 ,so it's value becomes 5
On day 4 , it decreases by 4 ,so it's value becomes 1
On day 5 , it increase by 5 ,so it's value becomes 6 ,
On day 5 night, she sells the stock to gain profit of 6
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor