I'm Axell
Hi, nice to meet you
This blog was created during my high school years to keep notes on OI contests, and some of the information may be outdated. Please visit www.axell.top to see the most recent blogs.

avatar
Axell
Axell's Blog

单源最短路&次短路

观光基本与单源最短路的套路相同，注意更新方案数并维护次短最短即可     阅读全文
Axell's avatar
Axell 8月 24, 2019
C++, 笔记

距离有关树形dp

    阅读全文
Axell's avatar
Axell 8月 22, 2019
C++, 笔记

最大权值子树

传送门     阅读全文
Axell's avatar
Axell 8月 20, 2019
C++, 题解

网络流

最大流dinic算法 struct node{ int Next,y,v; }Pth[88...     阅读全文
Axell's avatar
Axell 8月 17, 2019
C++, 笔记

yyhs模拟2018

巫师与恶龙(w...     阅读全文
Axell's avatar
Axell 8月 15, 2019
C++, 笔记