摘要：
无向图的欧拉路经，并且输出字典序最小的方案。 c++ include using namespace std; const int maxn = 1e4+10; bool vis[maxn][maxn]; vectorG[maxn]; int n, m; int d[maxn]; int main( 阅读全文
摘要：
二分+并查集 发现了一个很奇怪的问题，二分的上界设置错了，结果是运行错误。。。只有95分。后来改了上界就100了，百思不得其解 c++ include include include include include include include include include include us 阅读全文