（是非題）The running time of a dynamic programming algorithm is always $\Theta(P)$ where $P$ is the number of subproblems.