1. You are given a number n, representing the count of elements. 2. You are given n numbers, representing n elements. 3. You are required to find the maximum sum of a subsequence with no adjacent elements.
Input Format
A number n n1 n2 .. n number of elements
Output Format
A number representing the maximum sum of a subsequence with no adjacent elements.
Constraints
1 <= n <= 1000 -1000 <= n1, n2, .. n elements <= 1000
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
6 5 10 10 100 5 6
Output
116