anchor.diff:  		false ->
   			Cand2
   	end;
  -
  -	get_longest_increasing_subsequence([_Head|Tail],[_RHead|_RTail] = Result) when _Head =< _RHead ->
  +get_longest_increasing_subsequence([Head|Tail], []) ->
  +	get_longest_increasing_subsequence(Tail,[Head]);
  +get_longest_increasing_subsequence([Head|Tail], [RHead|_RTail] = Result) when Head > RHead ->
  +	get_longest_increasing_subsequence(Tail, [Head|Result]);
  +get_longest_increasing_subsequence([_Head|Tail], [_RHead|_RTail] = Result) when _Head =< _RHead ->
  +	get_longest_increasing_subsequence(Tail, Result);
  +get_longest_increasing_subsequence([_Head|Tail],[_RHead|_RTail] = Result) when _Head =< _RHead ->
   	get_longest_increasing_subsequence(Tail, Result).
   %1,3,4
   %1,3
  
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) ->
  