Thinking
In the absence of AC code and supporting records, the following ideas may be wrong.
See all take complete, probably conceivable min-max inclusion and exclusion.
Since the number of expressions inside legitimate expectations of the program is in the denominator inside, so you can think of it recorded in the state.
However, due to my food, just think of the beginning of the column-by-DP, then the complexity of the bombing ......
Consider plug DP: set \ (f_ {i, j, S, k} \) represents the current do \ ((I, J) \) , the contour line is a state \ (S \) , have \ (K \) a gift to take the program, the program number of coefficients with repellent capacity.
Transfer presumably fucks on the line?
Code
Gugu Gu