melon_sama的博客

为了方便自己阅读，将部分代码贴到 优快云 上。模板题#include<bits/stdc++.h>using namespace std;inline void read(int &x) { int s=0;x=1; char ch=getchar(); while(ch<'0'||ch>'9') {if(ch=='-')x=-1;ch=getchar();} while(ch>='0'&&ch<='9'

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int INF=0x3f3f3f3f;inline int read(){ int s=0,w=1; char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=ge

#include<iostream>using namespace std;const int N=1e5+5;int a[N], tmp[N];void merge_sort(int a[],int l,int r){ if(l>=r) return; // the length of the range no more than 1, then return int mid=l+r>>1; merge_sort(a,l,mid), merge_sort(a

#include<bits/stdc++.h>using namespace std;const int N=5e5+5, M=20;inline int read(){ int s=0,w=1; char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();} while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=

#pragma GCC optimize("O3")#include<bits/stdc++.h>using namespace std;#define SET0(a) memset(a,0,sizeof(a))#define FOR(i,a,b) for(int i=(a);i<=(b);i++)#define DWN(i,a,b) for(int i=(a);i>=(b);i--)#define INF 0x3f3f3f3ftypedef long long ll.

#pragma GCC optimize("O3")#include<bits/stdc++.h>using namespace std;#define SET0(a) memset(a,0,sizeof(a))#define FOR(i,a,b) for(int i=(a);i<=(b);i++)#define DWN(i,a,b) for(int i=(a);i>=(b);i--)#define INF 0x3f3f3f3ftypedef long long ll.

手写栈const int N = 2e5 + 5;struct Stack{ int a[N]; int tot = 0; void push(int x) { a[tot++] = x; } int pop() { int ret = a[tot - 1]; a[--tot] = 0; return ret; } int size() {

ll fpow(ll x,ll p){ ll res=1; for(;p;p>>=1,x=x*x%mod) if(p&1)res=res*x%mod; return res%mod;}

int x,y;void exgcd(int a,int b){ if(b==0) {x=1,y=0;return;} exgcd(b,a%b); int temp=x; x=y; y=temp-a/b*y;}

int gcd(int a,int b){ if(b==0) return a; return gcd(b,a%b);}

//链式前向星 存图 枚举每个结点连接的点 dfs //四个结点的有向完全图（例子）#pragma GCC optimize("O3")#include<bits/stdc++.h>using namespace std;#define SET0(a) memset(a,0,sizeof(a))#define FOR(i,a,b) for(int i=(a);i<=(b);i++)#define DWN(i,a,b) for(int i=(a);i>=(b);i--).