# Task
 Given a `sequence` of integers, check whether it is possible to obtain a strictly increasing sequence by erasing no more than one element from it.
# Example
 For `sequence = [1, 3, 2, 1]`, the output should be `false`;
 For `sequence = [1, 3, 2]`, the output should be `true`.
# Input/Output
 - `[input]` integer array `sequence`
    Constraints: `2 ≤ sequence.length ≤ 1000, -10000 ≤ sequence[i] ≤ 10000.`
 - `[output]` a boolean value
    `true` if it is possible, `false` otherwise.
def almost_increasing_sequence(s):
    p=-1
    l=len(s)
    for i in range(l-1):
        if s[i]>=s[i+1]:
            if p>=0: return False
            p=i
    return p<=0 or p==l-2 or s[p-1]<=s[p+1]
def almost_increasing_sequence(s):
    p=-1
    l=len(s)
    for i in range(l-1):
        if s[i]>=s[i+1]:
            if p>=0: return False
            p=i
    return p<=0 or p==l-2 or s[p-1]<=s[p+1]