int longest__plateau(int x[],int n)
{
int length=1;
int i;
for(i=1;i<n;i++)if(x[i]==x[i-length])length++;
return length;
}
int longest__plateau(int x[],int n)
{
int length=1;
int i;
for(i=1;i<n;i++)if(x[i]==x[i-length])length++;
return length;
}