Finding longest subsequence

See more:

Java

I need to write a code that will find the longest decreasing subsequence in input list of integers. For example. if the list is: 8 4 2 3 2, then the subsequence is 8 4 2.

With help of internet, I've got something like this so far, but it's not working for this and give me wrong answear.

int curr_len2 = 0, max_len2 = 1, start2 = 0;
		
		for (int i = 1; i <= list.size() - 1; i++){
			if (list.get(i) < listN.get(i-1)){
				curr_len2++;
				if (curr_len2 > max_len2){
					max_len2 = curr_len2;
					start = i - max_len2 + 1;
				}
			} else {
				curr_len2 = 1;
			}
		}
		
		for (int i = 0; i < max_len2; i++)
			listDesc.add(start+i);