Provincial selection Simulation Exam 1

Recently drowned by SPLAY,TREAP,DLX.

What's the feeling of not having written a test? It seems important to summarize.

T1

See codevs2466 for details.

The result of the original hash can only give 64MB (OJ is 256MB)

The water question has nothing to say. Map weight can be too

Harvest: (Study of a A-Cantor expansion)

T2

codevs2467

It seems obvious that you should sort by B first?

Feel the search is very porcelain did not think (Xiangbudao) DP is out of control

Positive solution is DP

F[I][J] Represents the former I-person, where 1 of the window is required for the time to go to J-minute

Two modes of transfer 1. i+1 person in the 1 window. At this time, the maximum value may be: The current i+1 people eat after dinner no one is eating: j+b[i] or the former I have a person than i+1 people are still late to eat f[i][j-a[i]]

2. In the 2 window, the same two modes of transfer: Sum[i]-j+b[i] or f[i][j]

Last F[n] The minimum value in a row.

Harvest: Greedy +DP combination

T3

codevs2468

In the change.

T4

Prepare to abandon the pit.

Provincial selection Simulation Exam 1