Nima_ghasem's blog

By Nima_ghasem, history, 5 weeks ago, In English,

I think the DP is so easy but that is very helpful... I dont know why but i think because it is the new type of programming so that is very easy and useful. I think the Dynamic Programming is best and when i see that tag on problem set i been happy! If you want to use greedy or other thing instead of DP you are really crazy because you prefer greedy instead of DP... So i think the Dynamic Programming is The BEST!

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

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

any body think an other thing?

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    I agree dp very useful, but it is not always easy to find a correct dp approach to a given problem. Also if the greedy approach to a problem gives the correct answer it is usually better to use that instead of dp since it is usually faster and easier to implement. Out of all competitive programming techniques my favourite is binary search.

»
5 weeks ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Wow I agree! I think DP is so easy im gonna use it for every binary search problem I see! If you use segment tree you're crazy, just do dp range query.

I been so happy when I see "data structures" or "constructive" algorithm tag! That I know its perfect for doing dp!

Dp is the BEST!

P.S Can I become red now?

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

I know those but i was say " ! DP THE BEST ! " for Beginers... So i should say in some problems DP is the only way to answer those questions :)