NOI Guide summary
Two days ago to Zhengzhou, he participated in the training what NOI Guide, and then found Gangster is really more, also found a very unexpected thing, Tsinghua University Beijing is not issued laptop and headphones, so why have three teachers exactly the same. . .
These days mainly to speak, NOIP knowledge-based, entitled provinces province topic ( teacher said delivery points (ming) the title ), the biggest gain is the original do not understand how the inclusion and exclusion, inverse, there is a heap do not know what Kichiku theorem understand, this topic the teacher, there are some basic ideas, and it will not be as violent as before. But some advanced topics will be no saving ideas, and they generally are through playing table to find the law or what rational analysis from a surface problem, to find a face looks and questions had nothing to do mathematical relationship, then you can use Some nest of mathematical formulas to complete, such as Ali and peach games , this title is probably the most water for the national team, but the water a black problem then why not? This question is at first glance looked like a game theory ( konjac would not ah ) and then in the teacher's constant reminder, only to find a break this thing, indeed, to no effect disconnect bisects two points, could not help but sigh. . . . . Indeed the work of the National Team. . . .
day1
day:
For the data structure day1, we can say he refreshed my knowledge, why can this play, stack, queue STL though these things there, but never understood his principles, then listen to the teacher, said it found, if indeed exam this thing it must be for him to test these properties, positive solution will miss much, this thing iced tea Ji also found that some playful nature, which seems to be running for the violence on the map, might even build more on several points. . . Some of the only regret is that he did not even say anything Fenwick tree! ! ! ! ! Is the job a while ago to make a phobia?
at night:
Feeling is that these days the most efficient one night, after a two segment tree, and then found out that pushdown () some deformation can do a lot of things
day2
morning:
day2 is Kichiku day, DP this thing seems to be a curse, Team chiefs seem to say this thing is to see that equation, and then we look stunned Formula One looked a long time. . . . . I thought he would say what DP modeling, but also look forward to for a long time, I did not expect so-called linear modeling DP is a morning talk backpack, or a variety of backpack, also thanks to the training, or else the backpack nine speak soon forgotten, and also learned some tips, whether it is 01 or backpack backpack full backpack or something else he had to be pressed and maintenance, in addition to the original 01 backpack, others are honestly I hit a two-dimensional, from only to find that it can overwhelm a small space, even if the topic and people card space can also be over after that day. Then the teacher also comes with a friendship PPT, which are all inscrutable things, what the state of compression, what digital DP. . .
in the afternoon:
This is almost forced to be the most ignorant afternoon, the teacher speaks up on a tree DP, for tree this structure should not have a good look ignorant I listen to the force, then discovered across the Liao fat brother, big brother and has wall began to study the nuts that determination of the eyes. . . . . The only feeling can also be a question you hear is the original big brother talked to the knight , and the third day I spend half an hour in addition to night classes about architecture blog, the whole rest of the time spent on this issue. . . . What the back section DP, the teacher is not enough time to see no speak, let us come back to see. . .
Night (Exam):
autistic. . .
- The first question would be a combination of several, I had wanted to force it, and then you see a space 64MB? ! ,What is this! ! ! It's forced me to give up ah. . . . , Positive solution is for each sub-tree branch to find the law, found that the number of combinations, plus a pass by inverse
- The second question is monotonous stack, huh? Yesterday, the teacher said this kind of thing is the kinds of questions, and this monotonous stack What is the relationship? ! And then hit a N 2 violent expect teachers to use his Apple computer running quickly, more than a few points. . . Positive solutions that can be used to find out about the stack monotonically greater than its first position, then O (n log ai) about the first time a process has a certain number of current local superset, then O can be (n) statistical answer, note the value of processing the same situation.
- The third question is really playing mentality, a question began to see the face, this is not the shortest it? SPFA? dijkstra? and then you see the right side. . . . . Then care for silence only tears of a thousand lines. . . . Opposite the big brother (the inventor dijksPA) using carrier pigeons to send a message: "The third question to give up ...." Positive solution is to consider the optimization of the number of sides. For a point, first sort out edge weight, the edge of even the reverse side to him, even down each side of the reverse side of a length of 0, and even up the difference of the length of the edge on both sides, to optimize the number of edges to the O (m). Time complexity O ((n + m) log n).
- Then look at the second problem has been to find ways to change the violence, hoping to get more than a few minutes, and then defeated by reality. . .
- I do not know is not a mixed blessing, way back along Zhengzhou accidentally ran a red light, then the next day to tell us, should shut the computer for the teacher, not the results. . . .
day3
morning:
For the first time I understood the congruence equation and the inverse! ! ! I feel a morning peak of life, for the first time for the teacher's subject With the right solution, and then also feel difficult to play, and then almost Chengsi noon meal. . .
in the afternoon:
PM speaks linear algebra, then found, in fact, matrix arithmetic, the teacher also talked about Fibonacci number, and then found a way to optimize, and later with a trumpet really try to hurry, for the combination of mathematics, remember those formulas found on more than a laptop, Lucas can feel, and then the teacher told a man named Lucas to expand the root of all evil, then the teacher's lullaby over. . . The evening also writing a blog, then play the Cavaliers, and almost never before. . . Feeling is the most decadent night. .
Day4
morning:
最轻松的一上午，没有之一，印象最深的就是老师说模拟就打一下猪国杀就可以了。。。感觉，贪心这个东西在听老师讲过之后发现了好多套路，例如起床困难综合征这题要是我去考NOI搞死都不会想到去打贪心，但听完老师的分析，感觉既出乎意料，又在情理之中，按位贪心确实很神奇，结果最后一天的考试就考了这个东西，发现有思路不会打。。。。递推就是传说中的找规律，，老师主要讲了棋盘覆盖，感觉这对递推没什么作用，反而对于DP的一些状态设计感觉学到了。。。二分就感觉还比较常规，题目也都是一些名题，然后就是分治，老师也就是说了一下CDQ分治感觉要谢一下老师，感觉所有例题我们都写过，然后老师在讲的时候就发现我们这边好快乐，但CDQ分治确实发现了一些好的主意事项，对于前一段的影响不一定非要暴力，可以用一些处理使算法更优秀。
下午：
这是真的很爽的一下午，感觉倍增没怎么听懂，看题面多少要好一点，但还是要回来花大力气搞，毕竟是一个重要的算法。LCA就很快乐，快乐快乐就看到了开车旅行这道题，然后感觉就在学习set这个东西是怎么用的，博客还没写完。。。
晚上：
本来想写沼泽鳄鱼，后来就被拉去看set。。。
day5
上午：
DFS的一些优化技巧，老师还说是水题，哪道不是紫的。。。。感觉剪枝这个东西的熟练度变高了不少，原来的剪枝只会判断非法，这次学会了最优策略，这确实很有用，一直想把蓝书上错了的小木棍给过了，现在感觉也不是很高深，对于mayan游戏，发现了不少DFS剪枝要注意的地方，每次剪枝都要去看看对于最优答案是否有影响，不要乱剪，会出事，
BFS感觉就没什么优化技巧，老老实实的就是最好的。
下午：
上午老师把下午的一并讲掉了，下午还问我们想听什么，让后就稍微提了一下博弈论，可以先打表，这个可以找规律，实在不会还可以递归，确实对于博弈论不会再束手无策
老师还给了一个好PPT，里面全是题目，有时间一定要全刷一遍。
晚上就把剪枝的技巧写了一下博客，还没写完
day6
昨天晚上来看我们时，感觉这个老师好好玩，一点没有国金的架子，还好幽默。。。。然后幽默就成了————他的所有例题都是：送分题（A----F）
上午：
上午讲了图的连通性，还有缩点什么的都还比较基础，但题目就实在不好说，有的听懂了不知道代码实现，有的愣是没听懂，反复折磨各位大佬才稍微了解，结果还提前下课了。
下午：
就主要写最短路，对于SPFA是真的少，题目都是一些常规题目，但想通往奥格瑞玛的道路，和灾后重建这些老题的方法有不仅仅是最短路，二分和DFS都是一些常见的和最短路搭配的套路，最小生成树就比较迷，听到D时就开始放弃思考。。。
晚上（考试）：
老师说是送温暖的，预计最高得分300，平均230。。。
- T1 就是一个签到题，对于样例，无力吐槽，找一找规律就可以发现一些骗分技巧，让后用倍增DFS优化一下就可以过了，老师说正解就是这么搞，然后就不知道为什么爆了，感觉码力还是太弱了。
- T2完全不知道题目再说什么，后来看了数据范围，发现有一个是链，一个是菊花图，就直接用n（n-1)，感觉好失败。正解和上次T1感觉有点关系，找到子树大小，然后每次都找一下，就会发现规律
- T3一看就感觉好熟悉，第一反应就是按位贪心，但他跟原来的题目相比多了一个下限，感觉完全不知道怎么判断，后来还想用前缀和，但&和|还不支持，后来就想方设法处理出来，后来应为优先级的问题搞了好长时间，再后来贪心对于下界就爆炸了，然后放弃打了一个半小时的算法，用5分钟打了暴力。。。。后来考完试问老师，老师说不满足交换律也没关系，可以看1最后变成了什么，0最后变成了什么，简化有用的操作，就可以按位贪心了，感觉自己最后一题第一次离正解这么近，然后打了暴力。。。
- 考试感觉不咋地，我比本校大佬低了六七十分。。。。
day7：
上午：
就讲了一些DP的优化，感觉NOIP好像用不到，连凸包什么的都出来了。。。。
最后一个下午：
总感觉有点不舍，但这是最欢乐的下午，就听老师说他怎么用暴力拿四五百分，然后变向嘲讽一下同学。。。。。
胖哥发现了一个好游戏，比赛打红题，看谁快，有趣的把老师都引过来了，老师还说了一句“这数据范围太真实了。。。。”，然后就发现胖哥一直输，好像除了鼠标，什么都要吃。。。
最后：
老师说还要讲什么好的意见，本来觉得没什么好写的，后来看模拟赛这么多，不由得感觉可以在洛谷或是平时的考试中举行考某个重点（图论，数论，DP，DFS，BFS，找规律什么的）的专题，感觉对于现在专题的提升比单一要高。。。。不得不说老师原来说什么找学伴的方法还挺好的。。。。还有建议规范一下机惨。。。。这个许仲远太可怕了，胖哥已经被过得毫无脾气