<awangdev>Longest Increasing Continuous subsequence_3.java
public int longestIncreasingContinuousSubsequence(int[] A) {
        if (A == null || A.length == 0) {
            return -1;
        }
        int maxLength1 = 0;
        int maxLength2 = 0;
        int track = 1;
        for (int i = 1; i < A.length; i++) {
            if (A[i] > A[i - 1]) {
                track++;
            } else {
                maxLength1 = track > maxLength1 ? track : maxLength1;
                track = 1;
            }
        }
        maxLength1 = track > maxLength1 ? track : maxLength1;
        track = 1;
        for (int i = A.length - 2; i >= 0; i--) {
            if (A[i] > A[i + 1]) {
                track++;
            } else {
                maxLength2 = track > maxLength2 ? track : maxLength2;
                track = 1;
            }
        }
        maxLength2 = track > maxLength2 ? track : maxLength2;
        return maxLength1 > maxLength2 ? maxLength1 : maxLength2;
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 ) {
    return - 1 ;
  }
  int var_5 = 0 ;
  int var_6 = 0 ;
  int var_7 = 1 ;
  for ( int var_8 = 1 ;
  var_8 < var_0 . length ;
  var_8 ++ ) {
    if ( var_0 [ var_8 ] > var_0 [ var_8 - 1 ] ) {
      var_7 ++ ;
    }
    else {
      var_5 = var_7 > var_5 ? var_7 : var_5 ;
      var_7 = 1 ;
    }
  }
  var_5 = var_7 > var_5 ? var_7 : var_5 ;
  var_7 = 1 ;
  for ( int var_8 = var_0 . length - 2 ;
  var_8 >= 0 ;
  var_8 -- ) {
    if ( var_0 [ var_8 ] > var_0 [ var_8 + 1 ] ) {
      var_7 ++ ;
    }
    else {
      var_6 = var_7 > var_6 ? var_7 : var_6 ;
      var_7 = 1 ;
    }
  }
  var_6 = var_7 > var_6 ? var_7 : var_6 ;
  return var_5 > var_6 ? var_5 : var_6 ;
}
