Endians forest

[manojdagar]

here now stands that small knot of villages known as the Endians, a mighty forest once stood. Indeed, legand has it that you could have stoodon the edge of the wood and seen it stretch out for miles, were it not for the trees getting in the way.
In one section of the forest, the trees stood in a row and were of hight from 1 to n, each hight occurring once and once only.
A tree was only visible if there were no higher trees before it in the row.
For example, if the heights were 324165, the only visible trees would have been those of height 3,4 & 6.

Write a Program that takes an array of integers representing the heights of the trees in the row as input and prints the list of the visible trees.

[ruskalym]

Maybe you should read sticky posts.

However I'll try to give you some clue.

Let's suppose heights are positive numbers.
We initialize a maximum variable to zero value.
Then for each height in list :
if it is greater than the maximum, then it is visible, so we set the maximum to that value, and so on...

Now it's up to you...