02 2020 档案

最短路之Floyd
摘要：#include<bits/stdc++.h>using namespace std;const int maxn = 300+10;int n,m,f[maxn][maxn],t;int main(){ memset(f,127/3,sizeof(f)); scanf("%d%d%d",&n,&m 阅读全文
posted @ 2020-02-16 20:59 HISKrrr 阅读(121) 评论(0) 推荐(0)
最小生成树
摘要：#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 1e5+10;int fa[maxn];struct Edge{ int from; int to; int w;}edg 阅读全文
posted @ 2020-02-16 19:41 HISKrrr 阅读(88) 评论(0) 推荐(0)
寒假集训并查集初级版
摘要：#include<cstdio>#include<cstring>#include<iostream>using namespace std;const int maxn = 105;int fa[maxn],height[maxn];int find(int x){ return fa[x] == 阅读全文
posted @ 2020-02-13 10:38 HISKrrr 阅读(117) 评论(0) 推荐(0)