Skip to content
#

max

Here are 7 public repositories matching this topic...

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 ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence ai. Let us remind you that the subsegment of the sequence is its continuous fragment. A su…

  • Updated Mar 9, 2020
  • Java

Improve this page

Add a description, image, and links to the max topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the max topic, visit your repo's landing page and select "manage topics."

Learn more