Module: 桥梁。发音点


Problem

1/4

上顶点的定义

Theory Click to read/hide

Error

Problem


计算所有顶点的向上数，假设 DFS 从顶点 1 开始，time_in 从 1 开始编号。 
您需要完成代码以便程序显示此问题的答案。

time 1000 ms
memory 32 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
#include <vector>
using namespace std;
int main()
{
 
for(int i = 0; i < arr.size(); i++)
cout << arr[i] << " ";
return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!