이분탐색
-
중량제한백준알고리즘 2019. 10. 3. 01:41
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 #include #include #include #include #include using namespace std; int n, m; int sx, fx; vector v[10001]; bool d[10001]; bool bfs(int value) { queue q; q.push(sx); d[sx] = true; while (!q.empty()) { int x = q.front(); q..