문제 링크 : boj.kr/2668난이도 : G5태그 : DFS코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n+1); for(int i = 1; i > arr[i]; } int cnt = 0; vector visit(n+1, -1); vect..