Problem - 14D - Codeforces
题意: 思路:
两条链不相交,说明是在不同连通分量中,我们可以枚举边来把树分为两个连通分量,然后分别计算直径即可
Code:
#include <bits/stdc.h>#define int long lo…
论文信息
题目:LEARNING TO EXPLORE USING ACTIVE NEURAL SLAM 作者:Devendra Singh Chaplot, Dhiraj Gandhi 项目地址:https://devendrachaplot.github.io/projects/Neural-SLAM 代码地址:https://github.com/devendrachaplot/N…