The time complexity of the dynamic programming algoritm to solve

The time complexity of the dynamic programming algoritm to solve the knapsack problem ( 0-1 version) is polynomial, only if we round all profit values up to lie in smaller range. ~@[](1)

答案：FALSE