Summary of Introduction to algorithms-Chapter 20 Dynamic Planning (5) Analysis of Several DP questions

Source: Internet
Author: User

I read the date of the previous article, which is 5.16. I haven't written it for 20 days. It's depressing. But the last exam is over, the next step is the sixth and the next three tests on the 18 th, which can be studied with peace of mind over the past few days.AlgorithmSo happy.

 

It is recommended that first look at the preface: http://www.wutianqi.com /? P = 2298

Total Directory: http://www.wutianqi.com /? P = 2403

 

In this chapter, I am going to analyze several typical DP questions on hdoj.

1. hdoj 1257 minimum Interception System

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1257

Analysis +Code: Http://www.wutianqi.com /? P = 1841

Classical Lis, DP entry-level questions.

 

2. hdoj 1176 free pie

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1176

Analysis + code: http://www.wutianqi.com /? P = 2457

The classic concept of this question is the transformation from a straight line to a number tower. Graphic analysis is given in the above connection.

 

3. hdoj 1160 fatmouse's speed

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1160

Analysis + code: http://www.wutianqi.com /? P = 2290

The topic of the longest ascending subsequence is novel. Here we can see the relationship between DP and BFS, recursion and dfs I wrote earlier.

 

4. hdoj 1080 human gene functions

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1080

Analysis + code: http://www.wutianqi.com /? P = 2413

I don't know what to say about this question. My personal experience is classic! We recommend that you.

 

In addition, I personally feel like I have done a lot of work on the DP questions. I have previously reproduced 46 DP questions on hdoj summarized by the cool people. Hey hey, let's provide the link:

Http://www.wutianqi.com /? P = 550

Tell me who will do it all. I want to worship it.

Now, DP is over. The following is the greedy algorithm ~~~

 

Tanky Woo labels: DP, dynamic planning, tanky Woo

In my independent blog: http://www.wutianqi.com /? P = 2559

You are welcome to learn from each other and make progress!

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.