Untitled

int i = 0 , j=0;
boolean flag = 1 // > , 0 means <
while(j<n - 1)
{ 
 if(flag && arr[j]<arr[j+1])
 {

    i = j;
    j++;
    flag = 1;
 }
 else if(!flag && arr[j]>arr[j+1])
 {

    i = j;
    j++;
    flag = 0;
 }
 while(arr[j] == arr[j+1])
 {
    i = j;
    j++
 }
 if(arr[j]>arr[j+1])
   flag = 0;
 else
   flag = 1;
 maxLen = MAX(maxLen , j - i + 1);
 j++;    
}
return maxLen;