Call a sequence x$1,...,$ xm of numbers convex if xi $<$

xi$1+$xi$+1$

$2$

for all $1<$ i $<$ m$.$ Give

an O$($n

$3$

$)$ time algorithm to compute the length of the longest convex subsequence of an

arbitrary array A$[1...$ n$]$ of n integers.