Last Theorem CodeForces - 1325F（dfs樹找最大環+思惟）

It’s the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let’s just stick with finding either.c++ Given a connected graph

>>阅读原文<<