{"problem":{"name":"Lower","description":{"content":"There are $N$ squares arranged in a row from left to right. The height of the $i$\\-th square from the left is $H_i$. You will land on a square of your choice, then repeat moving to the adjacent square","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc139_c"},"statements":[{"statement_type":"Markdown","content":"There are $N$ squares arranged in a row from left to right.\nThe height of the $i$\\-th square from the left is $H_i$.\nYou will land on a square of your choice, then repeat moving to the adjacent square **on the right** as long as the height of the next square is not greater than that of the current square.\nFind the maximum number of times you can move.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq H_i \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$H_1$ $H_2$ $...$ $H_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc139_c","tags":[],"sample_group":[["5\n10 4 8 7 3","2\n\nBy landing on the third square from the left, you can move to the right twice."],["7\n4 4 5 6 6 5 5","3\n\nBy landing on the fourth square from the left, you can move to the right three times."],["4\n1 2 3 4","0"]],"created_at":"2026-03-03 11:01:13"}}