自己敲模板还是有很多容易错的地方 写在注释里面了 LCA #include<bits/stdc++.h> #define REP(i, a, b) for(register int i = (a); i < (b); i++) #define _for(i, a, b) for(register int i = (a); i <= (b); i++) using namespace std; ; //以后MAXN改成N.因为MAXM和MAXN不容易区分 ; ]; int head[…
NOIP模板总结 进考场先打一份缺省源: # include <cstdio> # include <iostream> # include <cstring> # include <string> # include <algorithm> # include <cmath> # define R register int # define ll long long using namespace std; int main() {…
网络流 Dinic(搭配飞行员) //Serene #include<algorithm> #include<iostream> #include<cstring> #include<cstdlib> #include<cstdio> #include<cmath> using namespace std; const int maxn=100+10,maxs=maxn*maxn+2*maxn; int n,m,S,T; int aa…
好像要1A模板题.完败 下面主要是一波SB错误总结 最小生成树(忘了sort(QwQ)) // It is made by XZZ // Fei Fan Ya Xi Lie~~~ #include<cstdio> #include<algorithm> using namespace std; #define il inline #define rg register #define vd void typedef long long ll; il int gi(){ rg int…
马上就要noi了……可能滚粗已经稳了……但是还是要复习模板啊 LCT: bzoj2049 1A 7min # include <stdio.h> # include <string.h> # include <iostream> # include <algorithm> // # include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long dou…
