qingwen_z的专栏

#define lowbit(x) (x&(-x))int const maxn=3333;int tree[maxn],n;void add(int p,int val){ while(p<=n) { tree[p]+=val; p+=lowbit(p); }}int getsum(int p){ int sum=0; while(p>0) { sum

const int maxn=10000010,M=26;struct node{ int num; node *nt[M],*fail; void init() { num=0; for(int i=0;i<M;i++) nt[i]=NULL; fail=NULL; }}T[maxn];#define root Tint cnt;void insert(ch

const int maxn=50010;const int INF=0x3f3f3f3f;struct SBT { int key,left,right,size; } tree[maxn]; int root,top; void left_rot(int &x) { int y = tree[x].right; tree[

int gcd(int a,int b) { return b==0?a:gcd(b,a%b); }int lcm(int a,int b) { return a/gcd(a,b)*b; }int a[maxn][maxn],x[maxn];int equ,var;int Gauss(){ int i,j,k,max_r,col; int LCM,tmp,ta,tb; fo

const int MAXN=110010;char Ma[MAXN*2];int Mp[MAXN*2];void Manacher(char s[],int len){ int l=0; Ma[l++]='$'; Ma[l++]='#'; for(int i=0;i<len;i++) { Ma[l++]=s[i]; Ma[l++]='#'; } Ma[l]=0;

const int maxlen=110,kind=26;struct Trie{ int nt[maxlen][kind],fail[maxlen],end[maxlen]; int root,L; int newnode() { for(int i=0;i<kind;i++) nt[L][i]=-1; end[L++]=0; return L-1; } void

#include#define min(a,b) ((a)<(b)?(a):(b))const int MAX=2100000000,MAXn=200+9;int n,answer,g[MAXn][MAXn],d[MAXn],gap[MAXn],st=1,ed=n;int sap(int u,int flow){ if(u==ed) return flow; int res=fl

#include #include #include #include #define N 100001using namespace std;int n, a[N], b[N];int size, p[N], s[N], o[N], c[N][2];void update(int x){ s[x] = s[c[x][0]] + s[c[x][1]] + 1; o[x

// 倍增算法int wa[maxn],wb[maxn],wv[maxn],wss[maxn];int rank[maxn],height[maxn],sa[maxn];int cmp(int *r,int a,int b,int l){return r[a]==r[b]&&r[a+l]==r[b+l];}void da(int *r,int *sa,int n,int m){

#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define pi (acos(-1.0))

#include#includeusing namespace std;const int MM=100005;int next[MM],extand[MM];char S[MM],T[MM];void GetNext(const char *T){ int len=strlen(T),a=0; next[0]=len; while(a<len-1 &&

#include #include #include using namespace std; #define N 1005 char str1[N], str2[N]; int LCS(){ int num[2][N], i, j, k; memset(num, 0, sizeof(num)); for( i = 0; i < strlen(str1);

const int maxn=333;int n;int parent[maxn];void UFSet(){ for(int i=0;i<=n;i++) parent[i]=-1;}int find(int x){ int s=x; while(parent[s]>0) s=parent[s]; int tmp; while(s!=x) { tmp=pa

const int MAXN = 410; struct bign { int len, s[MAXN]; bign () { memset(s, 0, sizeof(s)); len = 1; } bign (int num) { *this = num; } bign

struct eu{ int a,b,x,y,q; void extend_euclid(int a,int b) { if(b==0) { x=1;y=0;q=a; } else { extend_euclid(b,a%b); int tmp=x; x=y;y=tmp-a/b*y; } }};

struct node{ bool flag; node *next[2]; node() { next[0]=next[1]=NULL; flag=false; }};void insert(node *&root ,string word){ if(root==NULL) root=new node(); node *p=root; for(int i=0;i

void getpre(char *s){ int j=-1,i; p[0]=-1; int n=strlen(s); for(i=1;i<n;i++) { while(j>=0&&s[j+1]!=s[i]) j=p[j]; if(s[j+1]==s[i]) j++; p[i]=j; }}void kmp(){ int j=-1,i,n=strlen(sa),m

#define NMax 10000struct node{ int key,mn,delta; int revmark; node *p,*l,*r; node(){}};struct DynamicTree{ node *nodes; int N; static void ini_node(node *p){ p->p=p->l=p->r=NULL; p->revm

#define N 5LL random(LL n){ return (LL)((double)rand()/RAND_MAX*n+0.5);}LL multi(LL a,LL b,LL m) //(a*b)%m{ LL ans=0; while(b>0) { if(b&1) ans=(ans+a)%m; b>>=1; a=(a+a)%m; } return a

#include#include#include#include#include#includeusing namespace std;//****************************************************************// Miller_Rabin 算法进行素数测试//速度快，而且可以判断 <2^63的数//******