Here the trick is not to distinguish between error and
From time to time update
1, multi-dimensional dp when we must calculate the spatial complexity, if necessary, consider rolling or Kaka border
2, dp things related to time and matching, consider each set of matching open dp, that is one-dimensional representation of the current record how many points have been selected, but made a point to another point in the match has not been determined
3, what meaning dp are "continuous \ (m \) th least one / not continuous \ (m \) th" sequence, we can record \ (F_i \) represents the length of \ (I \) legitimate sequence, while the \ (f_ {i-1} , f_ {i-2}, ..., f_ {im} \) transfer