I feel only after I leave the school stage , such ” When I get up in the morning, the painful day begins again , The painful day before going to bed at night is finally over , Then I lay in bed thinking about growing a little longer tonight , Tomorrow had better never come “ To end

Today's exam strategy is not good

Time arrangement

8.00-10.30

I'm still young I have a look at T1： see sb greedy ！ Then look again 2： This is not the original question ？ have a look 3 It's a feeling ds String Algorithm

Then I T1 Crazy greed My first kind of greed can't beat the small sample I'm very hard to clam The second big example goes to 220

Then I changed another edition My first greed ran away The second one ran to 22

I ：well original sb It's me

10.30-11.40

Write T3 sam+ The prefix and inquiry O（1）

10.40-…

Had a meal Thinking of coming back to write, everyone will write T2 violence Results found ： Bengbu caught I won't GA Then I didn't have time to play T1 Of dp 了

Topic analysis

T1

Disorderly greed Maintain with heap

upd

After calming down, think about it and write that search Remember Complexity is $3^9\ast 4^2$

Loss of pain 36 branch alas The exam strategy is too bad Has been greedy greedy

T2

No violent pruning Shark, I'll forget

upd

1. Violent pruning （ Learning

2. What you don't notice doesn't include ？ Part of （ Watch the sky

28 branch

It feels like it can be taken 48, I feel very bad

T3

Consider coming up with sam Then process the answer of each string Then prefix min Deal with the answers it contains

upd：

There's a and sam Relevant parts ：

Consider from for each inquiry And then from $l$ Start along dag go Then the answer is a path to the root min

Then at a certain point occ identical I will definitely take this point len The smallest

Consider the two parts of the answer ： First of all occ This thing can dfs Maintain the suffix tree （ The sum of the number of subscripts in the subtree ）

Then consider $\sum a$ It's good if we can consider any position of it say concretely as long as dfs Just give him the position in the sub tree （ I really didn't expect this ）

In this way, the answer of each point is determined And then again dfs Maintain every point to root min

This is a $\sum _{i=1}^q(r_i-l_i+1)$

Then consider getting some more points ： Set up a Mo team

Plus the first violence, a total of 53

summary If we can fight violence today You can hit the list 10 了 ）

But in the end, I really didn't expect this

But beat other violence to 48+10+14 I feel ok ）