UCF Local Programming Contest 2015 I. Longest Path（竞赛图 求哈密顿路径）

$任意两个点之间有且仅一条有向边，这是一个竞赛图。竞赛图一定存在哈密顿路径。

 

竞赛图（百度百科）

竞赛图是通过在无向完整图中为每个边缘分配方向而获得的有向图（有向图）。 也就是说，它是一个完整图形的方向，等价于一个有向图，其中每对不同的顶点通过单个有向边连接，即每对顶点之间都有一条边相连的有向图称为竞赛图。设D为n阶有向简单图，若D中基图为n阶无向完全图，则称D是n阶竞赛图。

性质：每对顶点之间都有一条边

任何有限数量n个顶点的竞赛图都包含一个哈密尔顿路径，即所有n个顶点上的直线路径。

 

Longest Path

You are visiting a lovely garden, with several points of interest.  Every pair of points of interest have a single, one way path (edge) connecting them.  (The paths are one way so that guests don't get upset having to deal with other guests walking in the opposite direction.)  Luckily, you get to decide which point of interest to begin from.  Naturally, to get your money's worth, you'd like to visit as many of the points of interest as possible without revisiting any point of interest, since that would be a waste of time.  Determine a walking path that allows you to visit the maximal number of