"Baidu Star 2014~ Qualification contest problem Solving report"

Statement

The author of the recent accidental discovery of the author's personal site http://tiankonguse.com/a lot of articles are reproduced by other sites, but reprinted without stating the source of the article or the reference from the http://tiankonguse.com/site, so. The author joins this statement.

Solemnly declare: This record "title" reproduced from the http://tiankonguse.com/of this record:

id=666 "target=" _blank "style=" word-wrap:break-word; Word-break:normal; margin:0px; padding:0px; Color:rgb (153,153,153); Text-decoration:none ">http://tiankonguse.com/record/record.php?

id=666

Objective

The recent graduation, half a year did not do the game.
This time to participate in the star of Baidu Entertainment.
Now write a report on the problem solving.
Daniel is too bothered to be the star of Baidu in this competition. So I was very fortunate to reach the former hundred, Baidu does not know whether to achieve the same as the hair of a dress.

Body

This game has four questions, at first it was just doing it casually, so I did it backwards.

First look at the type of four questions:

Energy Conversion Violence Complexity O ( log (n) )

id=663 "target=" _blank "style=" word-wrap:break-word; Word-break:normal; margin:0px; padding:0px; Color:rgb (153,153,153); Text-decoration:none ">disk Schedule DP complexity O (n ^ 2)

id=664 "target=" _blank "style=" word-wrap:break-word; Word-break:normal; margin:0px; padding:0px; Color:rgb (153,153,153); Text-decoration:none ">xor Sum Dictionary Tree Complexity O (32n)

id=665 "target=" _blank "style=" word-wrap:break-word; Word-break:normal; margin:0px; padding:0px; Color:rgb (153,153,153); Text-decoration:none ">labyrinth DP or search complexity O (n*m)

The first one went through a lot of people, so I simply didn't see the first question.

Later found that the first problem is to do first.

First question Energy Conversion

Test Instructions : Tell you an initial value. Ask if you can get a value greater than or equal to the formula that tells you. It is assumed that the minimum number of conversions can be output, not output-1.

method : Direct violence is possible.

Precautions:

1. A <= V Special Inference

2. K < 2 o'clock Special inference

3. A >= B Special inference

Detailed Problem solving report :

id=662 "target=" _blank "style=" word-wrap:break-word; Word-break:normal; margin:0px; padding:0px; Color:rgb (153,153,153); Text-decoration:none ">http://tiankonguse.com/record/record.php?id=662

Second question Disk Schedule

Test Instructions : The disk has n tracks, and each track needs to read one sector of data. The head is initially in the 0 track 0 sector, and finally on the 0 Track 0 sector. The movement between tracks consumes a certain amount of time, and the movement between sectors consumes a certain amount of time, reading data consumes certain data. Minimum time.

method : DP. When the state transfer equation str[I [j] represents the maximum track position I, the track chosen to go back is the optimal value of J.

Precautions: None

Detailed Problem Solving report : http://tiankonguse.com/record/record.php?id=663

Third question Xor Sum

Test Instructions : tell you n numbers. The number with the number K XOR or the highest value.

method : The dictionary tree is inserted from a high position. The reason is that high and low are not an order of magnitude. So high priority is given.

Precautions: None

Detailed Problem Solving report : http://tiankonguse.com/record/record.php?id=664

Question Fourth Labyrinth

Test Instructions : There is a matrix, each position has a value. You are in the upper left corner, going to the upper right corner. Just go right, up and down. Ask for the number and maximum value of the route.

method : DP. Each position is divided by the maximum value down above, the right side to the maximum value and down to the maximum can be.

Note : The first line does not have the maximum value above. The first column has no optimal value to the right and the best value to come down, and the last line does not have the optimal value down.

Detailed Problem Solving report : http://tiankonguse.com/record/record.php?id=665

References

Http://tiankonguse.com/record/record.php?

id=662

http://tiankonguse.com/record/record.php?id=663

http://tiankonguse.com/record/record.php?id=664

http://tiankonguse.com/record/record.php?id=665

"Baidu Star 2014~ Qualification contest problem Solving report"