C++ question

sternn

I have an exam tomorrow, and one of my lectures was inept...didnt know how to teach. This here is a question from his sample paper and I have no clue how to do it. Can anyone help??


Given a series of n daily price quotes for a share, the span of a
shares price on a certain day is the maximum number of
consecutive days up to the current day that the price of the
stock has been less than or equal to its price on that day. Write
down in pseudo code a quadratic time algorithm which takes an
n-element array P of share prices and calculates an n-element
array S of spans.

Giblet

Basically, you have an array of share prices.
You want to traverse the array backwards for each price in the array, until you determine the span for the day, checking if the current value of P is greater or equal to the days before it. Insert this value into the Span array.

You want an answer like this...
P = { 0, 1, 2, 1 }
S = { 0 ,1, 2, 0 }

A Quadratic time algorithm for doing this should give you a bit of leeway
ie: You can use a nested loop.

So basically, start with an Array of size N to hold your share values, and create an Array of size N to hold your spans.