Someof Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day!Since each cow is self-conscious about her messy hairstyle, FJ wants to countthe number of other cows that can see the top of other cows' heads.<o:p></o:p>
Each cow i has a specified height hi (1 ≤ hi ≤ 1,000,000,000) and isstanding in a line of cows all facing east (to the right). Therefore, cow i can see the tops of the heads of cowsin front of her (namely cows i+1, i+2, and so on), for as long asthese cows are strictly shorter than cow i.<o:p></o:p>
Forexample:<o:p></o:p>
Thereare six cows, heights are 10 2 7 3 12 2.<o:p></o:p>
NowCow#1 can see the hairstyle of cows #2, 3, 4
Cow#2 can see no cow's hairstyle
Cow#3 can see the hairstyle of cow #4
Cow#4 can see no cow's hairstyle
Cow#5 can see the hairstyle of cow 6
Cow#6 can see no cows at all!<o:p></o:p>