Venue: \ (= 100 + 10 + 110 0 \)
T1:
See \ (m \) so much, so I thought of the moment ride.
But it seems not found, then punched a big greedy.
To shoot ran \ (30 + \) minutes at all true, then confidently pay, really \ (AC \) .
T2:
Exam first thought \ (O (nlog ^ 2n) \) of the tree line, I had not found. So began "fantastic."
Finally, think of the magic block.
After the game the students said block is \ (O (m root n) \) , and I found time seems not pass. . .
But I feel like I do not have a point \ (TLE \) . . .
Constantly changing details of the final success \ (AC \) , \ (700 + MS \) no card line.
Block play good!
T3:
Multiplicative function?
to sum up:
For an algorithm, we must first consider the time complexity.
Then take a look at implementation complexity. (Do not come out when the time code)
for those less obvious algorithm correctness, must be careful to test.
Oh, and do not exceed the space.
Now: \ (100 + 100 + 0 = 200 \)