lhc121386的博客

DescriptionN(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill rank. To improve their skill rank, they often co...

OJ链接DescriptionYaoYao has a company and he wants to employ m people recently. Since his company is so famous, there are n people coming for the interview. However, YaoYao is so busy that he has no t...

DFS序与欧拉序的区别dfs序：是指将一棵树被dfs时所经过的节点顺序（不绕回原点）。欧拉序：就是从根结点出发，按dfs的顺序在绕回原点所经过所有点的顺序。用图说话dfs序：A-B-D-E-G-C-F-H欧拉序：A-B-D-B-E-G-E-B-A-C-F-H-F-C-ADFS序DFS序核心代码const int maxn = 1e5+5;vector<int> g...