i had read topcoder tutorial for dynamic programming but i am unable to understand state or much more please anyone help me.

# | User | Rating |
---|---|---|

1 | tourist | 3438 |

2 | moejy0viiiiiv | 3288 |

3 | W4yneb0t | 3218 |

4 | LHiC | 3196 |

5 | TakanashiRikka | 3178 |

6 | Petr | 3163 |

7 | Um_nik | 3150 |

8 | izrak | 3109 |

9 | ershov.stanislav | 3105 |

10 | mnbvmar | 3018 |

# | User | Contrib. |
---|---|---|

1 | rng_58 | 180 |

2 | tourist | 171 |

3 | csacademy | 170 |

4 | Petr | 162 |

5 | Swistakk | 158 |

6 | Errichto | 156 |

7 | matthew99 | 152 |

8 | Zlobober | 151 |

9 | zscoder | 139 |

10 | Endagorion | 138 |

i had read topcoder tutorial for dynamic programming but i am unable to understand state or much more please anyone help me.

↑

↓

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/24/2017 15:14:35 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|

I read it too and I didn't understand much either, so I started to solve basic dp problems and then I was in the right way, and progressing with dynamic programming.

on which judge i practice

I remember that my first dp problems where in uva, but there is plenty of good dp problems here in codeforces, just make sure at the beginning you pick the most basic ones.

how i know its basic or not?

You can start from here

DP is something that requires a lot of experience in order to become good at. I recommend starting off with problems here on CF. If you are new, try to avoid problems that also have tags relating to graphs and strings. You should practice later on, but not now because the skill set required for those problems is quite different from normal DP, and you need to grasp the basic idea of DP first. As mentioned in the title, I assume that you want to learn about DP on graphs also. The most common type of DP with graphs is DP on trees. There are many great problems here on CF, which you can easily find by using the tags "dp" and "trees". There exists some very interesting DP + graph problems that are not on trees, but these are generally quite hard to find (correct me if I'm wrong). The only one I can think of right now is 645D - Robot Rapping Results Report, which is a DP on DAG.