Kefa and First Steps — CodeForces | C++ Implementation
Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1≤ i ≤n) he makes money. Kefa loves progress, that’s why he wants to know the length of the maximum non-decreasing…