How many unique subproblems?

Assume that 1 i < j n or 1 i = j n.

All ways of choosing i and j for problem m[i,j] when i < j +

All ways of choosing i and j for problem m[i,j] when i = j

Only polynomial number of unique subproblems.