Hamiltonian and Lagrangian

Author: anantkaushik

Python/hackerearth/hamiltonian-and-lagrangian.py

@@ -0,0 +1,39 @@
+"""
+Problem Link: https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/hamiltonian-and-lagrangian/
+
+Students have become secret admirers of SEGP. They find the course exciting and the professors amusing. 
+After a superb Mid Semester examination its now time for the results. The TAs have released the 
+marks of students in the form of an array, where arr[i] represents the marks of the ith student.
+Since you are a curious kid, you want to find all the marks that are not smaller than those on its 
+right side in the array.
+
+Input Format
+The first line of input will contain a single integer n denoting the number of students.
+The next line will contain n space separated integers representing the marks of students.
+
+Output Format
+Output all the integers separated in the array from left to right that are not smaller than 
+those on its right side.
+
+Constraints
+1 <= n <= 1000000
+0 <= arr[i] <= 10000
+
+SAMPLE INPUT 
+6
+16 17 4 3 5 2
+SAMPLE OUTPUT 
+17 5 2
+"""
+def maxMarks(marks):
+    res = []
+    maxMark = -1
+    for mark in marks[::-1]:
+        if mark >= maxMark:
+            maxMark = mark
+            res.append(mark)
+    return res[::-1]
+
+n = int(input())
+marks = list(map(int,input().split()))
+print(*maxMarks(marks))