본문 바로가기

알고리즘/플로이드 워셜4

2606 바이러스 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647#include #include #include using namespace std; vector dp;vector adj; int INF = 1000000000; int main() { int com, net; scanf("%d %d", &com, &net); adj.assign(com+1, vector(com+1, 0)); dp.assign(com + 1, vector(com + 1, INF)); while (net--) { int a, b; scanf("%d %d", &a, &b); adj[a][b] = 1; adj[b][a] = 1; dp[a][b.. 2019. 8. 27.
플로이드-워셜 최단거리 (더블릿) #include int dist[35][35] = { 0 };int fw[35][35] = { 0 };int main() {// 입력 모두 받음int nd, st, end;scanf("%d %d %d", &nd, &st, &end);for (int i = 1; i 2019. 5. 16.
1965 상자넣기 (오답, LIS 접근 필요) 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556#include #include using namespace std; vector vec;int adj[100][100] = { 0 };const int INF = 978654312; int main() { int n, num; scanf("%d", &n); for (int i = 0; i 2019. 5. 9.
2660 회장뽑기 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768#include #include using namespace std; #define INF 100000000;int d[1000][1000] = { 0 };int minNum=INF;vector rst; int main() { int n; scanf("%d",&n); for (int i = 1; i 2019. 5. 9.

티스토리툴바