During this period of study Summary (1.17 summary)

summarize

Went to the new learning environment, you feel you can, of course, because of the end of the period just ended, resulting in a little slack this time, the day after going home, still very happy.

During this time played in two weeks Saili buckle, codeforces the contest and the results are also in general, can only do keep pushing hard against the logic of the question in the event the subject using an algorithm, just a blank mind. By the following figures can be seen, how often ranking in kind, ha ha ha.

Here Insert Picture Description
Here Insert Picture Description

Here Insert Picture Description

Now generally brush on HDOJ problem, according to the steps of Daniel Brush title to sum up, from the beginning of the water problem, and later math problems, thinking problems, and now dynamic programming topics, topics more and more difficult, a slow speed is also growing, especially in the dynamic programming this stage, a question of difficulty is great, it takes a long time to build the state transition equation, since new to this idea, the very building equation slow, but also need to constantly do questions to consolidate, the week also simple contact with dfs, but it will only seek permutations and combinations with dfs. emmmm, probably the week A more than 80 questions (mostly water title)

Learn about Dynamic Programming

These days worked dynamic programming topics including the largest sequence and maximum continuous sequences and, 01 and 01 backpack backpack program print. This is just a small part of the backpack dp, and there are tree dp, dp probability, the interval dp dp and digital, etc. These have slowly learning. Backpack also includes a variety of issues: 01 backpacks full backpack, multiple backpacks. This time pondering backpack nine stresses, just watching the 01 backpack, backpack 01 provided the title has only made five, and most of these five questions to see the solution. Topic of dynamic programming is very flexible. To 01 backpack, for example, are not a few questions on the basis of 01 to 01 backpack or backpack on a frame, add a little limiting, then I will not. On the one hand I did not seriously consider, on the other hand also shows that I do not firmly grasp the idea of ​​dynamic programming.

Winter vacation plans

We can immediately go home, at home, then, taking the time to learn C ++, continue pondering backpack nine stresses, on time and participate in the competition. Of course, if I can control my own words.

Published 24 original articles · won praise 32 · views 1687

Guess you like

Origin blog.csdn.net/weixin_45729946/article/details/104022112