목록다익스트라 (1)
Deep Learning study
백준 13161문제
#include using namespace std; const int MAX_V = 502; const int S = 500; const int E = 501; const int INF = (1 0){ f[cur][next] += df; f[next][cur] -= df; return df; } } } return 0; } int main(){ ios_base::sync_with_stdio(false); int N; cin >> N; for(int i=0 ;i> where; if(where == 1){ c[S][i] = INF; adj[i].push_back(S); adj[S].push_back(i); } else if(where == 2){ c[i][E] = INF; adj[i].push_back(E..
백준 문제 코드
2019. 9. 22. 15:33