qq_41037114的博客

D - Nearest Common Ancestors POJ - 1330 A rooted tree is a well-known data structure in computer science and engineering. An example is shown below:   In the figure, each node is labeled with an inte...

实现 我们设f[i][j]表示i节点的第2^j代祖先，这样f[i][0]就是i的父亲，而对于所有j>0，我们有 f[i][j] = f[f[i][j - 1]][j - 1] 怎么理解呢？ i节点的第2^(j - 1)代祖先的2^(j - 1)祖先就是i的第2^j代祖先 所以我们用O(nlogn)的时间就预处理出了f[][]数组 void dfs(int u,int fa){ ...

E - Design the city ZOJ - 3195  Cerror is the mayor of city HangZhou. As you may know, the traffic system of this city is so terrible, that there are traffic jams everywhere. Now, Cerror finds out th...

B - How far away ？HDU - 2586  There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house A ...

D - Connections between cities HDU - 2874 After World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materials needed can only be produced in c...

F - Network  HDU - 3078  The ALPC company is now working on his own network system, which is connecting all N ALPC department. To economize on spending, the backbone network has only one router for e...

Rescue the Princess Time Limit:1 Second Memory Limit:65536 KB Princess Cjb is caught by Heltion again! Her knights Little Sub and Little Potato are going to Heltion Kingdom to rescue her. He...