Please forgive me for T3 did not understand
why the topic did not even say how to count the distance! ! !
I (ju ruo) Forget a Manhattan distance! ! !
But did not count a negative number! ! !
Then positive solution to this fight hung up ......
ooo, ooo ......
also I 100, I 100 also ......
240 on the ......
ooo, ooo ......
it was so overturned ......
T1:
Race:
Recursive + minimum spanning tree, cut the sample directly
Forget the hand of the several data also
After the game:
You can also use actually like pressure DP? ? ?
Well, I was too dishes ......
Topic positive solutions:
Generating a recursive tree minimum pressure DP +
T2:
Race:
DP 1 hour pushed the formula
The sample is then blown up
Then hit the table cheat points
After the game:
Ooo, ooo ......
There is a wrong place
Then change with the change on the AC
Then was told of a gangster violence on constant 900ms + card
I was too dishes ......
Topic positive solutions:
DP
T3:
Race:
The distance from Manhattan counted as a negative number and then did not consider direct blow
The sample did too ......
After the game:
The change from the formula
Then considered a negative number, then pitted again the shortest path (Floyd)
Topic positive solutions:
Shortest
T4:
Race:
It looks like a minimum cut
But traffic is what ah!
Then I hit a maximum flow minimum cut requirements found explode ......
So happy DFS + Floyd had lost one sample (good rare ah!)
After the game:
30 points, expected.
But look at this solution to a problem can be cut with minimal ah! ! !
Missed positive solution ......
But DFS + Floyd + Dijkstra can change the greedy over
moment
what……
Topic positive solutions:
Greedy network flow Shortest
to sum up:
Or to a little self-confidence, try to play a positive solution
I can not understand because the meaning of the questions wrong and positive solutions to fight hung up ......
Come on!
