18sui

AcWing算...

AcWing other(1) Acwing算法模板及理解(5) AcWing算法竞赛进阶指南(3) Mysql(1) other(1) 洛谷(1)

/ 注册

全部文章 / AcWing算法基础课（共53篇）

AcWing 867. 分解质因数

AcWing 867. 分解质因数 #include <bits/stdc++.h> using namespace std; int n; void divided(int x){ for(int i=2;i<=x/i;i++) { ...

AcWing

2020-08-04

0 359

AcWing 866. 试除法判定质数

AcWing 866. 试除法判定质数 #include <bits/stdc++.h> using namespace std; int n; bool prime(int x){ if(x<2) return false; for(int i=2;i<...

AcWing

2020-08-04

0 260

AcWing 861. 二分图的最大匹配

AcWing 861. 二分图的最大匹配 #include <bits/stdc++.h> using namespace std; const int N=510,M=2e5+10; int n1,n2,m; int h[N],e[M],ne[M],idx; int match[...

AcWing

2020-08-04

0 343

AcWing 860. 染色法判定二分图

AcWing 860. 染色法判定二分图 #include <bits/stdc++.h> using namespace std; const int N=1e5+10,M=2e5+10; int n,m; int h[N],e[M],ne[M],idx; int color[N...

AcWing

2020-08-04

0 283

AcWing 859. Kruskal算法求最小生成树

AcWing 859. Kruskal算法求最小生成树 #include <bits/stdc++.h> using namespace std; const int N=2e5+10; int n,m; int p[N]; struct Node{ int a,b,w; ...

AcWing

2020-08-04

0 316

AcWing 858. Prim算法求最小生成树

AcWing 858. Prim算法求最小生成树 //y总做法 #include <bits/stdc++.h> using namespace std; const int N = 510,INF=0x3f3f3f3f; int n, m; int g[N][N]; bool s...

AcWing

2020-08-03

0 251

AcWing 854. Floyd求最短路

AcWing 854. Floyd求最短路 #include <bits/stdc++.h> using namespace std; const int N=210,INF=1e9; int n,m,Q; int d[N][N]; void floyd(){ for(in...

AcWing

2020-08-02

0 292

AcWing 852. spfa判断负环

AcWing 852. spfa判断负环 #include <bits/stdc++.h> using namespace std; const int N=1e6+10; typedef pair<int,int> PII; int n,m; int h[N],e[N...

AcWing

2020-08-02

0 324

AcWing 853. 有边数限制的最短路

AcWing 853. 有边数限制的最短路 #include <bits/stdc++.h> using namespace std; const int N=5e2+10,M=1e4+10; int dist[N],backup[N]; int n,m,k; struct Nod...

AcWing

2020-08-02

0 321

AcWing 850. Dijkstra求最短路 II

AcWing 850. Dijkstra求最短路 II #include <bits/stdc++.h> using namespace std; const int N=1e6+10; typedef pair<int,int> PII; int n,m; int h...

AcWing

2020-08-02

0 246