Skip to content

17EGICS031_ARRAY_8 #141

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
agarwalgeetika2000 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

17EGICS031_ARRAY_8 #141

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 23 additions & 0 deletions 17EGICS031_ARRAY_8
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
Given an array of positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should not
#be adjacent in the array.


list=[]
n=int(input("Enter the size:"))
maxi=0
for i in range(n):
ele=int(input())
list.append(ele)
inc=0
exc=0
for i in range(n):
if exc > inc:
new_exc = exc
else:
new_exc = inc
inc = exc + list[i]
exc = new_exc
if exc > inc:
print (exc)
else:
print (inc)