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: 
  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),
  
  
negative.code: %1,2
  %
  %3,4
  %
  %print_list([]) ->
  %	io:format("~n");
  %print_list([Head|Tail]) ->
  %	io:format("~p ", [Head]),
  %	print_list(Tail).
  