Is there any more efficient way to get the maximum sum of strictly increasing subsequence of size 4? I have used DP where DP[i][j] = max(DP[k][j-1]) such that k < i and A
