int[] arr = data[];
int[] fInc = new int[n];
fInc[0] = 1;
for(int i = 1; i < n; i++){
fInc[i] = 1;
for(int j = 0; j < i; j++){
if(arr[i] > arr[j] && fInc[j] +1 > fInc[i]){
fInc[i] = fInc[j] + 1;
}
}
}
从第一位开始,记录该位的最大子串,后面求最大子串可以利用
f(i) = max{1,f(j)+1} j<i且arr[j] < arr[i]