public int getLongestIncreasingSequenceDP(int[] a) {
		int[] l = new int[a.length];
		Arrays.fill(l, 1);// 1 case

		for (int i = 1; i < a.length; i++) {// max(L(i))+1 case
			for (int j = 0; j < i; j++) {
				if (a[i] > a[j] && l[i] < l[j] + 1)
					l[i] = l[j] + 1;
			}
		}
		return print(l);
	}