Sachin always wanted to score more and more runs for his team. Sometimes he succeed in doing that and sometimes he fails.He also has a habit of noting down the runs he scored after every match in his diary. After N matches he always look for his scores. In i-th match he score A[i] runs. Now he wanted to know the length of the maximum non-decreasing sub segment in sequence A. As he want to go for another match, help him in doing this task.
The first line contains T denoting the number of test cases . Then T test cases follow . The first line of each test case is an integer N . Then in the next line are N space separated values of the array A [ ] .
Print a single integer which denotes the length of the maximum non-decreasing sub-segment.
1 ≤ A[ ] ≤ 109
2 2 1 3 4 1
2 2 9
In the first test the maximum non-decreasing sub-segment is the segment with numbers from the third to the fifth one.
In the second test the maximum non-decreasing sub-segment is the numbers from the first to the third one.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.