Help in a cses judge problem

→ Pay attention

*has extra registration

→ Streams

By aryanc403

Before stream 33:12:03

View all →

→ Top rated

→ Top contributors

View all →

→ Find user

→ Recent actions

Detailed →

Help in a cses judge problem

By Black_hat123, history, 7 years ago, In English

Can someone please tell how to solve This problem

Comments (1)

Show archived | Write comment?

7 years ago, hide # |

find 2 node which simple path between them is diameter of the tree

int dfs(v)
	int ans = 0
	for (u : child of v)
		ans = max(dfs(u))
		{max1, max2} = dist(u -> all(leave))
ans = {max1 + max2, v}
return ans

get depth of each vertex

dfs from both of the node 

-> depth1[], depth2[] ([] = all node)

ans[v] = max(depth1[v], depth2[v])

→ Reply

The only programming contests Web 2.0 platform

Server time: Apr/25/2026 04:17:57 (k2).

Desktop version, switch to mobile version.

Supported by