qq_41780519的博客

强连通分量可以看作一组点 这组点中任意两个都是可到达的 然后把这一组点抽象成一个点即可#include<iostream>#include<cstdio>#include<algorithm>#include<string.h>using namespace std;const int maxn = 1e5+100;const ...

验证了一下网络流的板子题发现有一个板子和kuangbin聚聚的板子效率相差不多可能还更高效kuangbin聚聚写的是非递归的 这个可能更容易敲一点题目大意就是输入n,m找到s t直接连图求最大流https://blog.youkuaiyun.com/Code92007/article/details/88581495（附链接）#include<iostream>#...

扫描线板子题 没啥好说的输入矩形两点 然后求覆盖两次的面积（sum为覆盖面积,sums为覆盖两次的面积）#include<iostream>#include<cstdio>#include<algorithm>#include<map>#include<string>#include<string.h&gt...

#include<iostream>#include<cstdio>#include<queue>#include<string.h>using namespace std;int t,n,m;const int maxn = 1e3+10;int mp[maxn][maxn];const int inf = 0x3f3f3f3...

k层图典型例题就是可以任意选取k条边使得他们权值变化然后问最短路//// Created by xingchaoyue on 2019/7/27.//#include<iostream>#include<cstdio>#include<queue>#include<string.h>using namespace std;...

扩展kmp本质还是kmp有点类似马拉车就是改变next数组含义为与记录与自身最长的公共前缀的长度（这个也用扩展kmp求）#include<iostream>#include<cstdio>#include<cmath>#include<string.h>#include<cstring>using namespac...

高斯消元就是求解多元一次方程组的模版具体的步骤就是每次从未知主元中选取一个作为主元找到系数最大的一个方程将方程的主元项系数化1带入其他方程使得其他方程的该主元系数变成0#include<iostream>#include<cstdio>#include<cmath>using namespace std;#define eps...

裸板子到现在我复杂度还是不会算#include<iostream>#include<cstdio>#include<string.h>#include<cstring>typedef long long ll;using namespace std;int tot = 1;int las = 1;struct node{ ...

//// Created by xingchaoyue on 2019/9/10.//#include<iostream>#include<cstdio>#include<algorithm>using namespace std;const int maxn = 2e5+1000;const int M = maxn*30;int t[m...

想了想还是继续更新博客吧（虽然咕了这么久树状数组我感觉就是前缀和和差分数组的进阶形式具体的讲解就

终于搞懂了AC自动机#include<cstdio>#include<cstring>#include<algorithm>#include<queue>#include<iostream>#include<string.h>using namespace std;const int maxn = 5000...

https://blog.youkuaiyun.com/acmore_xiong/article/details/52870338

//tarjan牛逼#include<cstdio>#include<iostream>#include<string.h>using namespace std;const int maxn = 500000+100;const int maxq = 500010;int F[maxn];int find(int x){//找到祖先 ...

There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other....

//// Created by xingchaoyue on 2019/4/21.////kmp//输入一个母串和子串 问你子串第一次在母串中出现的位置 若未曾出现输出-1#include<iostream>#include<cstdio>using namespace std;int x[10000+100];int y[1000000+100];i...

先po一份定理KMP最小循环节、循环周期：定理：假设S的长度为len，则S存在最小循环节，循环节的长度L为len-next[len]，子串为S[0…len-next[len]-1]。（1）如果len可以被len - next[len]整除，则表明字符串S可以完全由循环节循环组成，循环周期T=len/L。（2）如果不能，说明还需要再添加几个字母才能补全。需要补的个数是循环个数L-le...

https://blog.youkuaiyun.com/weyuli/article/details/10141881根据这篇博客作为模板

先输入一堆子串，再输入一个母串询问有多少个子串在母串中出现过（模仿的洛谷大佬的板子//// Created by xingchaoyue on 2019/4/19.//#include<cstdio>#include<cstring>#include<algorithm>#include<queue>const int ...

统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 63448Accepted Submission(s): 21903Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单...

https://blog.youkuaiyun.com/u013615904/article/details/43373601