https://111qqz.com/en/tags/tarjan/Recent content in Tarjan on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzTue, 12 Apr 2016 12:28:42 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-12-hdu2586/Tue, 12 Apr 2016 12:28:42 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-12-hdu2586/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=2586" target="_blank" rel="noreferrer">题目链接</a> 题意：一棵树，给出n-1个边权，然后q组查询，每组查询询问两个点之间的距离。 思路：</p>https://111qqz.com/en/post/acm-icpc/2015/2015-08-16-codeforces567epresidentandroadse4bc98e58588e9989fe58897efbc8be8bfaae69db0e696afe789b9e68b89efbc8btarjan/Sun, 16 Aug 2015 19:26:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-16-codeforces567epresidentandroadse4bc98e58588e9989fe58897efbc8be8bfaae69db0e696afe789b9e68b89efbc8btarjan/<p>题意是说，给定一个有向图，对于每一条边，问是否是s到t的最短路上一定会经过的边．</p>