模板来源：HKer_YM的博客 12345678910111213struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;

模板来源:HKer_YM的博客 1求区间第k大 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374#include <bits/stdc++.h>using n

123456789101112131415161718192021222324252627282930313233343536373839404142const int MAXN = 1e5 + 5e2;int Next[MAXN];char str1[MAXN], str2[MAXN]; //这里以str1为母串，str2为子串inline void getNext() { Ne

1.匈牙利算法 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152#include<bits/stdc++.h>using namespace std;typedef long long ll;#define endl '\n'

1.dinic 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859const int MAXN = 2e3 + 5;const int INF = 0x3f3f3f3f;struct Edge{ int to,val

模板来源:HKer_YM的博客1.指针建树 12345678910111213141516171819202122232425262728293031323334struct node { node* child[MAXN]; int flag; node() { memset(child, NULL, sizeof(child));

模板来源:HKer_YM的博客1.求最长回文长度或回文子串个数 123456789101112131415161718192021222324252627282930313233343536373839404142434445//求回文串的个数inline int Manacher(string s){ //转换字符串 memset(hw, 0, sizeof(hw));

1.并查集 123456789101112const int MAXN = 1e5 + 5e2;int bin[MAXN];inline int find (int x) { return bin[x] == x ? x : (bin[x] = find(bin[x]); }inline void merge(int a, int b) { int fa = find

模板来源：HKer_YM的博客1.线性筛 1234567891011121314151617181920212223242526// 复杂度: O(n)void init() { phi[1] = 1; for (int i = 2; i < MAXN; ++i) { if (!vis[i]) { phi[i] = i - 1; p

1.安装Nodejs我用的是ubuntu，所以直接apt 1$ sudo apt install nodejs 1.2安装npmnpm是nodejs的包管理工具 1$ sudo apt install npm 2.安装hexo这里建站是使用hexo快速生成的 1$ sudo npm install --unsafe-perm --verbose -g hexo 2.1然后初始化 1234$ he