WA是一笔财富

// pos = 当前处理的位置(一般从高位到低位)// pre = 上一个位的数字(更高的那一位)// status = 要达到的状态,如果为1则可以认为找到了答案,到时候用来返回,// 　　 给计数器+1。// limit = 是否受限,也即当前处理这位能否随便取值。如567,当前处理6这位,// 　　 如果前面取

17/2/11已知三角形三个顶点坐标，则周长，面积，重心，外心公式：//设三个顶点坐标为（x1,y1）（x2,y2）（x3,y3）double a=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));double b=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3));double c=sqrt((x3-x2)*(x3-x2)+(y3-y

我是在kuangbin巨巨的模板的基础上加上了初始化和模式串的插入。代码：struct Trie{ int next[MAXN][26], fail[MAXN], end[MAXN]; int root, L; void insert(char buf[]) { int len = strlen(buf), now = 0; for(int i = 0; i < len;

链-反链-Dilworth定理偏序集：We define a Partially Ordered Set, or a Poset, as a set P with a partial ordering  defined on it’s elements. I.e, for any two elements x and y of P, either x ≤ y, y ≤

ll bit[1000005];int n;ll sum(int i)//注意自己修改类型{ ll s=0; while(i>0) { s+=bit[i]; i-=i&(-i); } return s;}void add(int i,int x){ while(i<=n) { bit[i]+=x; i+=i&(-i); }}

//ISAP#include #include #include #include #define ll long long#define MAXN 10005#define inf 0x3f3f3f3f3f3f3f3fusing namespace std;int n,m;//题目输入点数，边数struct Edge{ int v,next; ll cap,flow;}

#include#define ll long long#define inf 0x3f3f3f3fusing namespace std;const int MAXN=110;const int MAXM=100010;int head[MAXN],pre[MAXN],dis[MAXN],book[MAXN];int cnt=0,N;//N为点数 struct node{ in

#include #include #include #include #define MAXN 10005#define inf 0x3f3f3f3fusing namespace std;int n,m;//点数，边数 struct node{ int v,w,next;}mp[MAXN*100];int pre[MAXN],dis[MAXN];int cnt=0;v

二进制优化模板：void zero(int cost,int weight){ for(int i=V;i>=cost;i--) dp[i]=max(dp[i],dp[i-cost]+weight);}void complet(int cost,int weight){ for(int i=cost;i<=V;i++) dp[i]=max(dp[i],dp[i-cost]+we

#include #include #include #include #define inf 0x3f3f3f3f3f3f3f3f#define ll long long#define MAXN 10005using namespace std;int n,m;//点数、边数 int sp,tp;//原点、汇点 struct node{ int v,next; ll c

传送门：POJ1258最小生成树裸题，以后也可以当Kruskal算法的模板了。#include #include #include #include #include using namespace std;int f[100];int getf(int k){ return k==f[k]?k:f[k]=getf(f[k]);}struct node{ int u

namespace fastIO { #define BUF_SIZE 100000 //fread -> read bool IOerror = 0; inline char nc() { static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZ