알고리즘/위상정렬3 가장 멀리 떨어진 두 점 더블릿 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849#include #include #include using namespace std; int indegree[10005] = { 0 };int visit[10005] = { 0 };vector vec(10005);queue q;int dptMax[10005] = { 0 }; void dfs(int x) { if (vec[x].size() == 0) return; for (int i = 0; i 2019. 3. 12. 2252 줄세우기 123456789101112131415161718192021222324252627282930313233343536373839#include #include #include using namespace std; int indegree[33000] = { 0 };vector adj(33000);queue q; int main() { int n, m; scanf("%d %d", &n, &m); for (int i = 0; i 2019. 3. 9. 1516 게임개발 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455#include #include #include #include using namespace std; int cost[600] = { 0 };int indegree[600] = { 0 };int rst[600] = { 0 };vector adj(600);queue q; int main() { int n; scanf("%d", &n); for (int i = 1; i 2019. 3. 9. 이전 1 다음