Xlint101

分类

acceleration(18) ACM模板(26) java(3) kotlin(2) stars(1) 日记(1) 未归档(30) 真·随笔(10) 配置(1) 题解(1)

/ 注册

全部文章（共4篇）

LCA

for distance or ancestor #include <bits/stdc++.h> #define FOR(I, A, B) for (int I = (A); I <= (B); ++I) #define PER(I, A, B) for (int I = (A...

图论

2020-02-17

0 260

dijkstra

void dijk(int sta) { FOR(i,1,n) dis[i]=inf; dis[sta]=0; priority_queue<Pair,vector<Pair>,greater<Pair> >q; q.push(MP(dis[sta],s...

图论

2020-02-22

0 203

kruscal

#include<bits/stdc++.h> using namespace std; const int maxn=2e5+10; int fi[maxn],ne[maxn],v[maxn],w[maxn]; struct re { int x,y,z; }; re a[maxn]...

图论

2020-02-22

0 184

tarjan

强连通分量 int low[maxn],dfn[maxn]; int sta[maxn];//secondary stack in SCC int point[maxn];//scc that vertices belong to bool omit[maxn];//if the vertiex ...

图论

2020-03-24

0 266