6.29 simulation summary

It's broken

When I broke the defense, I exploded one question. After the game, I responded that there was no problem with the complexity of the direct search. I didn't feel much anymore

I really don't understand how it can be so superficial and behind the scenes

Last time I told you, I promised you well He also said that he had disciplined his children well As a result, I lost something in less than half a month ？

If you can't discipline your child, you should not have a baby To lose is not to lose

Today is the day to hang up 70 branch ？ In fact, it can not be counted as hanging The main thing is bad habits + Problems with a bad attitude

Time arrangement

7.30-9.30

Look at the question Find routine questions that are not very thoughtful I knew it was over

T1 In a broad sense sam T2 It always reminds me of a problem that I did in the simulation competition before （ In that case, I won't count the number of trees Then I can't remember when I do this problem There is a bit of default 2 No more ）T3 No idea What do you think? What do you think

9.30-11.00

I want to understand T1 Of 50 After thinking for a while, I didn't think it would be optimized Just rush

Here I made a mistake in detail , But when I measure the large sample Because it doesn't use much linux Of diff So I googled my answers and big examples It feels like it's almost over The habit here is really bad ）

11.00-12.00

Because I was influenced by that question before I have a little acquiescence that the violence of finding the number of trees is difficult to write about the feeling that the complexity is wrong （ Because I can't remember how I ordered it A little affect the mentality ） So I started to play with my hands In the end, I couldn't do it

（ After the game, I just went out to write about it ha-ha Hard clam

Topic analysis

T1

In a broad sense sam After the suffix tree is created, the virtual tree is greedy

My mistake is ： The property of discarding suffix tree is completely As a pure tree dp 了 It must be noted that The depth should not be taken when merging Instead, we should take this point at sam Upper len value

There are two reasons ：1. Inadequate understanding 2. I didn't measure the large sample well

T2

Because this question is too similar to the previous one （ In my vague memory ）

So when I think, I always recall in that direction

But I can't remember

Just send it

upd：

listen lyc and wxq Talked about it. 60

It can only be said that I really did not think of ）

T3

This is a town that can't send

upd：

Listen to the 10 and 30 How to do it I don't think I can think of it

It seems that I have many skills in messing with data structures Push dp Relatively poor Optimization dp ok

as well as One of the trees is $n^{(n-2)}$ ( Dead eye ）