随笔分类 -  算法基础.搜索与图论

摘要：code: #include<bits/stdc++.h>//xfl using namespace std; const int N = 2e5+10; int h[N],ne[N],to[N],siz[N]; int n,num,minn=N; void add(int a,int b){ne[ 阅读全文

摘要：code: #include<bits/stdc++.h>//xfl using namespace std; const int N = 2e4+5; const int maxx = 0x3f3f3f3f; int f[N],o[N],to[N],d[N],n,m,k,v[N]; void fo 阅读全文

摘要：code: #include<bits/stdc++.h> using namespace std; const int N = 2e5+5; int h[N],ne[N],to[N],d[N],num,x,y,n,m; queue<int>q; void add(int u,int v) { ne 阅读全文