anchor.diff:  
   get_longest_increasing_subsequence([], Result) ->
   	lists:reverse(Result);
  -get_longest_increasing_subsequence([Head|Tail], []) ->
  -	get_longest_increasing_subsequence(Tail,[Head]);
  -
   get_longest_increasing_subsequence([Head1,Head2|Tail],[RHead|_RTail] = Result) when Head2 > Head1, Head1 > RHead ->
   	get_longest_increasing_subsequence([Head2|Tail], [Head1|Result]);
  -
   get_longest_increasing_subsequence([Head1,Head2|Tail],[RHead|_RTail] = Result) when Head2 =< Head1, Head1 > RHead ->
   	Cand1 = get_longest_increasing_subsequence(Tail, [Head1|Result]),
   	Cand2 = get_longest_increasing_subsequence(Tail, [Head2|Result]),
  -	
   	L1 = length(Cand1),
   	L2 = length(Cand2),
   
  
positive.code: %1,2
  %
  %3,4
  
negative.code: 	Perm5 = [1,4,2,3],
  	[1,2,3] = get_longest_increasing_subsequence(Perm5),
  
  	Perm6 = [1,2,3,4,9,5,6],
  	[1,2,3,4,5,6] = get_longest_increasing_subsequence(Perm6),
  
  	perfect.
  
  get_longest_increasing_subsequence(List) ->
  