c6376315qqso的专栏

const int inf = 0x3f3f3f3f; const int MX = 105; const int MXE = 4 * MX * MX; struct MaxFlow { struct Edge { int v, w, nxt; } edge[MXE]; int tot, num, s, t; int head[MX]; vo

namespace MCMF { int S, T;//源点，汇点 int tot, n; int st, en, maxflow, mincost; bool vis[MX]; int head[MX], cur[MX], dis[MX]; int roade[MX], roadv[MX], rsz; //用于打印路径 const int

int nxt[MAXN],extend[MAXN];   char S[MAXN],T[MAXN];   void GetNext(char *T)   {       int a=0;       int Tlen=strlen(T);       next[0]=Tlen;       while(a     next[1]=a;       a=1;      

const int SIGMA_SIZE = 130; const int MAXNODE = 1000*55; const int MAXS = 150 + 10; struct ACautomata { int ch[MAXNODE][SIGMA_SIZE]; int f[MAXNODE]; // fail函数 int val[MAXNODE]; // 每个

int cntA[MAXN],cntB[MAXN],sa[MAXN],tsa[MAXN],Rank[MAXN],A[MAXN],B[MAXN],height[MAXN]; void build_sa(char* ch,int n) { for (int i = 0; i < 256; i ++) cntA[i] = 0; for (int i = 1; i <= n; i ++)

链接：https://www.nowcoder.com/acm/contest/146/H 来源：牛客网   题目描述 Niuniu likes playing games. He has n piles of stones. The i-th pile has ai stones. He wants to play with his good friend, UinUin. Niuniu c...

Problem Description Chika is elected mayor of Numazu. She needs to manage the traffic in this city. To manage the traffic is too hard for her. So she needs your help.  You are given the map of the ci...