How to solve Chef and Way using Dynamic Programming?

Правка en1, от dush1729, 2016-01-13 20:36:47

I am trying to solve this using dynamic programming with complexity of O ( N ^ 2 ) which will give TLE because N <= 10 ^ 5.

Problem Link

Теги dynamic programming, codechef, lunchtime

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский dush1729 2016-01-13 20:36:47 235 Initial revision (published)