Get well, but \ (86.5 \) points should barely be able to enter.
Before the game
A week before the game is a little nervous, because is necessary to review the preliminary round. Very different preliminary and semi-finals, semi-finals can get the first prize, the preliminary round may not be able to test very well.
The most disgusting of course, is that computer "common sense" ......
So I will spend most of the time back a variety of concepts such as TCP / IP protocol so.
Also spent some time reviewing the permutations and combinations, again pushing the various formulas.
Even the natural numbers power and are reviewed again.
Go to the Sanxin, play around before the game.
Sanxin good environment in which to suppress ah ...... I am very glad that they are in junior high school Jizhong.
When the game
Naturally from scratch. Basically there is no difficulty in front of the subject, but common sense is also not a few questions computer (so I am white reviewed)? There is no problem with the arrangement requires a combination of point brain.
Then there reading program.
This program does not read the same as before, because now read really bad force simulation program, we must understand the meaning of the program.
The first program which led me to spend a long time and understand what it means, probably: the entire series turned into a number of segments in a row does not drop sequence, if \ (i \) at the end of sub-sequence, the \ ([i + 1 , j] \) interval less \ (a_i \) , and \ (J \) maximum; or \ (J = I \) .
The second program is extremely simple one to understand. Is the Number of different paths (i.e. calculates a tree \ (C_n ^ 2 \) ). However, when the brain make himself a compression path, then hung up a choice; and, in fact, there is no guarantee that data is subject to legal (a tree), resulting in two points themselves may be in communication with a block, so I was wrong a judge issues ......
good Biequ ah ......
The third program then let me very ignorant of the force. I can only simulate the force about how the implementation of the program, but it can not understand the meaning.
In desperation, I can only just hard.
First, first determine the problem is obvious, do not explain ......
then is the second, just for a long time, just do not come out (went on to do a perfect program title).
After the return, the third question include the counterexample is determined.
The fourth judge found that the title seems good evidence, seems to be right (but actually I was wrong ...... remove the " \ (+ 1 \) " is right), and then on this basis, introduced the second question is correct.
(So two questions are wrong ......)
followed by multiple-choice questions. The first multiple-choice questions feel is \ (0 \) , which is obviously feeling was right (in fact, the length of the string can not be \ (0 \) , or how to read ah)
second multiple-choice questions do not come out (actual the lack of time), intuitive feeling \ (12 \) is right, then they chose.
Next is to improve the program. The first program is no difficulty, casually can \ (AK \) a (Also, I always wanted to TucaoNOIPThe time complexity of the complete program CSP-J / S's. If I do, it will definitely meet all the conditions with a stockpiling points)
second start did not understand a question, was a little anxious, because not far from the end. But this time, I pushed myself a simple formula DP found that this formula can be shaped pressure (I too dishes ...... I found it like pressure method)
so I filled out the first four relatively smooth empty, then empty the last time, I felt a bit strange. \ (D \) The latter option winshould be changed win&1only ah!
But I chose this, because other more tricky ......
however I discovered after the game, the original winis the booltype ......
(In fact, this problem can play as saying matrix multiplication ...... but I'm too lazy to Tucao, after all, CSP-J / S-shaped test pressure has been a major step forward)
After the game
Just out is a variety of answers, two sucker second track error reading program made me mentality collapse ......
should be a reason Tuka, the results came out at night. At the beginning of the achievements and Gufen not the same, after a complaint to change overnight.
Only \ (86.5 \) points ...... mentality collapse
for the third channel program to read, and now I probably get to know what it means.
\ (J \) is satisfied after the first \ (pre_ {i-1} <suf_j + 1 \) a \ (J \) , which means \ (pre_ {i-1} \ geq suf_ {j- 1} + 1 \)
If this condition is satisfied, \ (T \) is \ (s_ {0..i-1} + s_ {j-1..slen-1} \) substrings.
Corresponds to remove \ (\ s_ {i..j-2 }) after or \ (T \) of the letter string.
\ (ANS \) is the length of the longest substring removed
Sentence summary: I fried a dish