finally :'v

boolean almostIncreasingSequence(int[] sequence) {
    boolean jump = sequence[0]>=sequence[1]; // assuming it has at least 2 elements
    int max_val = sequence[1]; // de la subcadena casi creciente
    int last_max_val = sequence[0]<sequence[1] ? sequence[0] : sequence[1];
    for(int i = 2; i < sequence.length; i++){
        if(sequence[i-1]>=sequence[i]){
            if(jump) return false;
            else jump = true;
        } else {
            if(sequence[i]<=max_val && sequence[i-1]<=last_max_val && jump) {
                // este caso fue el que me mamo gallo xd
                return false;
            } else {
                last_max_val = max_val;
                max_val = sequence[i];
            }
        }
    }
    return true;
}