We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
from Volume 2. Data Structures :: Graphs
一道模式识别题。输入一张像素图,图上有几个骰子。要求识别图上的骰子的点数。并且从小到大排序输出。但是要注意:
求一张无向图的连通分支数,可以得知有几个骰子。然后把骰子作为一张子图再求其连通分支数,就可以知道骰子上的点数。可以用 DFS 来求连通分支数,则二重的 DFS 即可 AC 。