aopo's blog

By aopo, history, 3 years ago, In English

AcidRain

I tried solving it using the fact that there must be some collection of shield which should cover the entire range (B to E), but got the wrong answer. The tag says it to be related to dynamic programming. But how? I don't know. Can someone give any approach to how can it be solved with dp?

  • Vote: I like it
  • +4
  • Vote: I do not like it