A linear function has the form . Given slope and intercept , for any query , you get in . In CHT, each previous DP (dynamic programming) state (the subproblem index) contributes a line.
The slope and intercept depend on values computed at . The query point depends on the current state . Your DP becomes: evaluate all lines at , take the minimum. That's still per state. But most lines are worthless.