A longest increasing subsequence is an increasing subsequence of maximum length. Changing or deleting one term changes its length by at most one.