动态规划求递增子序列

package com.neu.test12;

import java.util.Scanner;

public class test34 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.nextLine());
        int arr[] = new int[n];
        String[] arr1 = sc.nextLine().split(" ");
        for (int i = 0; i < arr1.length; i++) {
            arr[i] = Integer.parseInt(arr1[i]);
        }
        int[] f = new int[n];
        f[0] = 1;
        for (int i = 0; i < n; i++) {
            f[i] = 1;
            for (int j = 0; j < i; j++) {
                if(arr[j] < arr[i] && (f[j] > (f[i] - 1)))
                    f[i] = f[j] + 1;
            }
        }
        for (int i = 0; i < f.length; i++) {
            System.out.print(f[i] + " ");
        }
    }

}