{"problem":{"name":"图的遍历（简单版）","description":{"content":"给出 $N$ 个点，$M$ 条边的有向图，对于每个点 $v$，求 $A(v)$ 表示从点 $v$ 出发，能到达的编号最大的点。","description_type":"Markdown"},"platform":"Luogu","limit":{"time_limit":2000,"memory_limit":524288},"difficulty":{"LuoguStyle":"P2"},"is_remote":true,"is_sync":true,"sync_url":null,"sign":"LGB3862"},"statements":[{"statement_type":"Markdown","content":"给出 $N$ 个点，$M$ 条边的有向图，对于每个点 $v$，求 $A(v)$ 表示从点 $v$ 出发，能到达的编号最大的点。\n\n## Input\n\n第 $1$ 行 $2$ 个整数 $N,M$，表示点数和边数。\n\n接下来 $M$ 行，每行 $2$ 个整数 $U_i,V_i$，表示边 $(U_i,V_i)$。点用 $1,2,\\dots,N$ 编号。\n\n## Output\n\n一行 $N$ 个整数 $A(1),A(2),\\dots,A(N)$。\n\n[samples]\n\n## Note\n\n- 对于 $100\\%$ 的数据，$1 \\leq N,M \\leq 10^3$。","is_translate":false,"language":"English"}],"meta":{"iden":"LGB3862","tags":["搜索","图论","广度优先搜索 BFS","深度优先搜索 DFS"],"sample_group":[["4 3\n1 2\n2 4\n4 3","4 4 3 4"]],"created_at":"2026-03-03 11:09:25"}}