单调递增最长子序列

import java.util.*;
import java.math.*;

public class Main {

public static void main(String[] args) {
Solution s = new Solution();
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] answer = new int
;
for(int i = 0; i < N; i++) {
answer[i] = s.getResult(sc.next());
}
sc.close();
for(int i : answer) {
System.out.println(i);
}
}
}
class Solution {
public int getResult(String s) {
int N = s.length();
char[] chArray = s.toCharArray();
int[] states = new int
;

for(int i = 0; i < N; i++) {
int pickMax = 1;
for(int c = 0; c < i; c++) {
if(chArray[c] < chArray[i]) {
pickMax = states[c] + 1 > pickMax ? states[c] + 1 : pickMax;
}
}
states[i] = pickMax;
}
int max = 1;
for(int i : states) {
if(i > max)
max = i;
}
return max;
}
}