1. Before we learn a knowledge (such as a new algorithmic knowledge), we should first understand what this knowledge is (what) and why this knowledge (why), and then to learn how to implement this knowledge (how), "C + + Primer" is based on this logic in the first chapter to an introduction, Further discussion of each chapter in the future.
2. The last week of freshman year in school:
A. Do not calculate the complexity of the time, to direct violence, and then a variety of overtime super memory, resulting in a waste of time without reading the problem. It is important to press the computer for a second to calculate 200w times to calculate whether the algorithm is feasible.
B. Do not go to figure who first question, but to slowly think of all the details, draw on the draft paper and then hand to write, it is actually more time-saving.
C. Do not give up the last second of the game! Many times finally found the bug and AC situation is very common AH!!!
D. Feel that they are already 14 in the comparison of the front of a team, winter vacation to seriously let them see my growth!!
E. The ability to code is worth paying attention to.
F. Read the question, do not just according to Borad on whether someone AC to judge whether the problem can be done, perhaps others are waiting for the first to die, this person why not me?
3. Truly understand the algorithm, and enjoy the beauty of it, will not forget. Just like I do not take notes in various classes, listen to the teacher carefully, feel those interesting, once will not forget. Of course, I am not very interested in English, take notes, repeatedly see or forget.
Knowledge: 1.http://www.cnblogs.com/shuaiwhu/archive/2012/04/22/2464583.html ( knowledge of Segment tree in ACM)
2014, December Summary
