Better complexity of Codechef Paying Up

Правка en1, от dush1729, 2015-12-26 18:18:17

Problem link

I have done this problem with time complexity O( nlogn + n * m ) and space complexity O( 2 * m ). How can i improve this?

Теги codechef, subset sum, dynamic programming, complexity

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский dush1729 2015-12-26 18:18:17 221 Initial revision (published)