CodeForces 66B Petya and Countryside （枚举）

B. Petya and Countryside

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Petya often travels to his grandmother in the countryside. The grandmother has a large garden, which can be represented as a rectangle 1 × n in size, when viewed from above. This rectangle is divided into n equal square sections. The garden is very unusual as each of the square sections possesses its own fixed height and due to the newest irrigation system we can create artificial rain above each section.

Creating artificial rain is an expensive operation. That's why we limit ourselves to creating the artificial rain only above one section. At that, the water from each watered section will flow into its neighbouring sections if their height does not exceed the height of the section. That is, for example, the garden can be represented by a 1 × 5 rectangle, where the section heights are equal to 4, 2, 3, 3, 2. Then if we create an artificial rain over any of the sections with the height of 3, the water will flow over all the sections, except the ones with the height of 4. See the illustration of this example at the picture:

As Petya is keen on programming, he decided to find such a section that if we create artificial rain above it, the number of watered sections will be maximal. Help him.

Input

The first line contains a positive integer n (1 ≤ n ≤ 1000). The second line contains n positive integers which are the height of the sections. All the numbers are no less than 1 and not more than 1000.

Output

Print a single number, the maximal number of watered sections if we create artificial rain above exactly one section.

Examples

input

1
2

output

1

input

5
1 2 1 2 1

output

3

input

8
1 2 1 1 1 3 3 4

output

6

这道题题意比较难理解，如果理解了题意枚举一下就AC了。

题意：求一个山字形，即中间数最大，两边的数依次减小的最大长度。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int i,j,k,l,m,n,a[1100];
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
		scanf("%d",&a[i]);
		int MAX=0;
		for(i=0;i<n;i++)
		{
			for(j=i+1;j<n;j++)
			{
				if(a[j]>a[j-1])
				break;
			}
			for(k=i-1;k>=0;k--)
			{
				if(a[k]>a[k+1])
				break;
			}
			MAX=max(MAX,j-k-1);
		}
		printf("%d\n",MAX);
	}
	return 0;
}