Stack No.2 peaks problem

Haha think of summer vacation in the United States the first topic worth remembering!!

1#include <cstdio>2#include <cstring>3#include <iostream>4#include <stack>5 using namespacestd;6 intn,h[15010],n;//N is the number of elements in the stack n is a total of how many mountains7stack<int> s;//Build a stack8 intans;9 Ten intMain () One { Ascanf"%d",&N); -  for(intI=1; i<=n;i++) - { thescanf"%d",&h[i]); -Ans+=n;//reach the next peak plus the elements from the previous stack -  while(N&&h[i]>s.top ())//when the current mountain height is higher than the previous mountain height out of the stack -    { + S.pop (); -n--; +    } AS.push (H[i]);//put the current height into the stack atn++; - } -printf"%d", ans); - return 0; -}

Stack No.2 peaks problem