Diary Ⅱ

Disclaimer: This article is a blogger original article, follow the CC 4.0 BY-SA copyright agreement, reproduced, please attach the original source link and this statement.

This link: https://blog.csdn.net/weixin_42557561/article/details/102674204

Previous blog too long to re-open a

Be solved:
Summary 1. FIG theory
2. The interval tree and dp dp
dp slope optimization 3.
4. The second element shortest risky approach + complexity analysis

2019/10/22

Examination morning
noon afternoon to change the title +
evening league Exams
(if job is done, go home at night and watch a while the book chant)
on your own time period to be resolved to complete [4]

Morning exam:
T1 WOJ # 4759 100 pts
T2 WOJ # 4760 30pts
T3 WOJ # 4761 0pts
Total: 130pts
highest: 200pts

I was too nan a ......
If Day1 130 can only take two days at most 260. Even a not so ah.
So, my pigs, to refuelヾ(◍ ° ∇ ° ◍) Techno゙
seriously do
brains enough to brush the question Minato

T1 third
proof convex function to the wave
(slope nondecreasing)

T2 data structure
algorithm a : transforming what circumstances the title, which is equal to the current count is greater than sea level, the number of points, then the statistics adjacent
two Fenwick tree on it
Sometimes the information can not be a one-time maintenance done, then we do not like to maintain separate yet
Algorithms II: consider maintaining each successive segment, we are in the leftmost statistics. I.e. statistics satisfy a [i] position <h && a [i + 1 ]> = h of

A feel useful things
statistics a sequence that satisfies a [i] <h && a [i + 1]> Number Number = h of
conventional thinking: For each h, O (n) sweep over
but a few many If the data set, obviously not
convert some ideas, see each a [i] h which will cause the contribution
apparently $a[i]+1$~ $a[i+1]$ This section h in both satisfy the conditions
just what you can to maintain a data structure

T3
CE? Lost 20pts
attention keyword conflicts (do not use random)

In fact, the range of data to this question is very wonderful ah. But I really live up to the topic of people's good intentions, he did not understand that.
The second data range $n<=5,m<=1e6$
do not feel very strange? So few points, while the number of sides turned out to be so much.
Description practically useful side rarely -> connect multiple sides of two mutually different direction, you can ignore the
positive solution is really wonderful!
Continue to reduce the number of sides, until finally there are n points, n / 2 edges
and then go back down step by step introduction of the answer
XOR Dafa is good %%%%%%

CF547D (T3 extension)

19: 00 ~ 20: 20 NOIP2014 way to find
w (゚Д゚) w I did not ......
ah ah ah ah ah ah, wrong again sb title! ! !
(No, no, this can not be regarded as sb problem, it should be vulnerabilities on their own thinking)
verify that each is able to reach the end point, with regard to the end as a starting point to build an anti map, then run bfs
As I yy that ran from the start dfs , there is a problem
such as

If I were to traverse to 2, then to 3, then 1
then 3 will not be marked as able to reach the end (because 1 has been traversed, but has not yet reached the finish line)

Left roar, the two water NOIPDay1T1 morning
that today count as completed three NOIP Zhenti it?
You can almost count it. # 1228 coupled with a solution of the equation
and then knock it CF547D

20: 45 ~ 21: 49 CF547D
this transformation is really fantastic
and as a weaker version of the 2019/10 / 22T3
worth doing

2019/10/23

Practice today ......
(yes, not the exam)
T1 WOJ # 4053 directory 78pts
T2 WOJ # 4051 test 30pts
T3 0pts
T4 24pts
Total: 132pts
highest: 296pts

T1 simulation
details more
! ! ! ! Seeing an array of open ancestors! ! ! !

T2 demolition absolute value
I'm so melon ......
think positive solution, but not to justify, it played only violence
is obviously a very good license Okay! ! ! !
After the exam or to their own brains to prove it (not habitually not permit)

T3 monotonous stack
this practice encountered many times ......
how or can not do this
Two rows of the pressure line
to determine the upper and lower bounds
(ST-dimensional table so violence is really the details of many. + 1-1 annoyed)

T4
should not be influenced by others. .
See gods abandoned the T4, I went along gangT3
results do not come out T3, T4 did not look
good in -1 partakers ...... otherwise really cool
test after the discovery of T4 significantly better do more

Just fucks ah. Change the title when dfs write hung up there are 50+
enumeration wave of Sao whole

Have their own rhythm, not subject to influence others

This morning wrote about solving equations
NOIP2014 are what stuff ah.
Day2T3 modulo it finished thing (of course, still have to Kaka often)
modulo is possible conflicting
That does not mean that if the original formula offspring into x 0
but is likely to die after taking the
possibility of conflict is relatively small but

Of course, if it did not think modulo finished
Summary: General encountered a big, big number, modulo remember! ! !
Modulo:, subtraction, multiplication can
(except with inverse words)

2019/10/24

Huh? Written yesterday was not any saved from?
It does not matter.

WOJ # 1809 Gardener
simple dp
initially misunderstood the meaning of the title
two conditions can only meet one (note that each is the condition for all 2 * i set up that way)
· · · Update 2019/10/25 · · ·
optimization queue can not monotonous
because height is not monotone, playing out in front of what might later affect
the data flood.

Today exam
(finished the discussion, we feel very stable ......
I am a person T1gang too long, it can not guarantee A.T2T3 only violence, but also and hanging T3)
wait ing achievement

T1 80pts
T2 10pts
T3 15pts
Total:105pts
最高：215pts

T1
find sub-tree size is not necessarily the smallest one!
The main long Tl write, to write more about the back, long codes

T2
dp? ?
the n- ³ dp quite miss it.
$[i,j]$ represents the maximum value of the interval i ~ j of formula
enumeration was last calculated operators k
is divided into two sub-problems
(Na Liangdao done before and there is wisdom different section do dp ?? !!)
Model transformation and application
Why is knowing when a problem being interpreted as dp can be thought out, otherwise it would not dare? Reflection!
Note nature:
The maximum nesting brackets need more than two layers
Can then be optimized to O (n) the
$f[i][0/1/2]$ 0,1,2 represent a few unmatched parentheses before i

Push the nature of the examination room! ! !

T3
examination push properties! ! !
Nature 1: x monotonically increasing, no turning back
Property 2: Matrix degradation may be a line segment, and only the left vertical Useful endpoints

Study up task:
Today T2 \ /
review congruence equation \ /
NOIP two Zhenti

2019/10/25

WOJ # 1810 Huarong
really good question ah. .
I love the graph theory QwQ
1. Complexity 2.dfs

dp thematic training
I love dpQwQ

1. dp review game remaining questions practice
   (since they are all done before, do not have to write code. focuses on ideas )
   Fill in the number of games to defend the kingdom +
2. Huarong problem solving ×
3. The old title was expected probability of single ×

And brushed up the extended Euclidean seek congruence equation

Brush dp day
summarize it

Problem angry bird with only one dimension?

2019/10/26

Night tasks:

1. Today exam T2, T3
2. That question on the scan line SOJ
3. Today exam summary
4. Tomorrow Learning Program

In fact only change over T2
me ...... Hey, come on girl

Summed up
examination
Tl 100 pts
T2 30pts
T3 40pts
the Total: 170pts
highest: 230pts

T1 to send sub-themes
to play table to find the law. Expected number of steps to go n steps is n
(initially not believe how simple, thought he hung up the deep search. Abruptly spent a 1h)
of course after the test still needs to prove rigorous
consideration of expected changes go a step after
the current the expected value is assumed to be $x ^ 2 + y ^ 2$
After each step there is a probability of a quarter
$(X + 1) ^ 2 + y ^ 2$
$(X-1) ^ 2 + y ^ 2$
$x ^ 2 + (y + 1) 2$
$x ^ 2 + (y-1) ^ 2$
Expanded The sum $s^2+y^2+1$

T2 good tree differential problem
of violence or well done

Due to limitations of solving the problem, we need to deal with two trees information (time code for the recall package)
in the differential B tree, a tree in the C modification a single point, the chain into sum (addition time code implementation subtree single point evaluated)
actually essentially equivalent to the differential operation ---- B tree tree tells C how to do

T3 doubling
violence still do well
initially misunderstood the meaning of problems. . String comparison does not understand that
otherwise should have time to think more violence sub-
string comparison is not a priority to see the length ah!
Bit-wise comparison

Know the feeling after positive solution, it is not hard
but it is unexpected
and does not analyze the complexity (so I will not re-construct their own son)

In fact, the entire sub-field examination, it was only the public
positive solution can not think, will fight violence
gap is still large ......
refuel it up

2019/10/27

10: 00 ~ 11:00 test T3
10:50 complete
11:00 ~ 12:00 scan line
12: 00 ~ 12:30 + explanations summarize exam yesterday
12:30 ~ 13:00 lunch
11:30 - 11:47 No manage their own, [decadent]
12:00 - 12:15 dinner
12:15 - 12:35 finish line scanning
12:35 - 13:10 exam summary
13:00 - 13:30 English newspaper
13:30 to 14 : 00 lunch break
14:00 - 15:00 optimize the slope dp
15:00 ~ 16: 00 expected probability dp
16: 00 ~ 17: 00 dp miscellaneous questions
17: 00 ~ 18: 00 dp + summary next week learning arrangements
18:00 ~ 19:00 dinner seating +
19: 00 ~ 22: 00 ldx to a single question
22:00 running