USACO 2004 February Green Distance Queries

最新推荐文章于 2020-03-23 19:25:06 发布

zhouhongkai06

最新推荐文章于 2020-03-23 19:25:06 发布

阅读量251

点赞数 1

分类专栏： LCA

本文链接：https://blog.csdn.net/zhouhongkai06/article/details/80471911

版权

农夫John的奶牛因为马拉松路线太长而拒绝参加。他需要找到一条更合理的路径。输入包括“Navigation Nightmare”的格式，后面跟着一个整数K（查询数量），然后是K条距离查询。每条查询包含两个农场的编号，要求计算这两个农场之间的路径长度。输出每个查询的距离。

摘要由CSDN通过智能技术生成

题目描述

Farmer John's cows refused to run in his marathon since he chose apath much too long for their leisurely lifestyle. He therefore wants to find apath of a more reasonable length. The input to this problem consists of thesame input as in "Navigation Nightmare",followed by a line containinga single integer K, followed by K "distance queries". Each distancequery is a line of input containing two integers, giving the numbers of twofarms between which FJ is interested in computing distance (measured in thelength of the roads along the path between the two farms). Please answer FJ'sdistance queries as quickly as possible!