See More

import java.util.*; import java.io.*; class AlmostSorted { static void almostSorted(int[] a) { int n = a.length; int up = 0, down = 0; int l = 0, r = 0; if(a[0]>a[1]){ up++; l = 0; } for(int i=1;ia[i-1] && a[i]>a[i+1]){ if(up==0) l = i; up++; } else if(a[i]