notking1's blog

By notking1, history, 6 weeks ago, In English,

I was looking through some DP probs and saw that most of the implementation was iterative and it was very hard to find recursive sols. So do you guys know anyone who has done many DP probs on CF and also writes recursively so I can view his code thank you.

 
 
 
 
  • Vote: I like it  
  • -6
  • Vote: I do not like it  

»
6 weeks ago, # |
  Vote: I like it -16 Vote: I do not like it

LoOooOoOoOOOoOOOLoOooOOoOoOLOooOOoOOoL. LMAO. ROFL. You can always convert iterative dp to its top down version. You just need to understand the dependence between the dp states and modify accordingly

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it