Noip 2012 Improved group Day1 Drive Drive Travel __noip

Noip 2012 Improved group Day1 Drive drive Trip

1. First sweep the next sample, looked at the data range, understand, if the sort, bubble is impossible, need to quickly sort.

2. Collect retrieving and begin to read the topic. The urgent matter, according to the idea, understand the sample.

3. Sample 1 Read, recursion is obvious, because there are obvious end conditions, dfs+ backtracking.

4. Example 2 read it, initially thought X0 is superfluous, after reread the topic, only then discovers X0 and Xi may unequal, the X0 tube output first Data, Xi tube next data, the basic idea is X0 and Xi to find the maximum value to calculate, notes the smaller value corresponding data.

5. Think about it, should be able to make.