Given a vector of integer (large > 10000) find the largest subsequence of consecutive monotone number, for example given the vector [1,2,4,0,1,-1,-2,-3,-4,1,2] the largest subsequence is [1,-1,-2,-3,-4].
to compile from terminal:
$ make Miglior_sequenza