摘要：
Nested DollsTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2643Accepted Submission(s): 785Problem... 阅读全文
摘要：
Cuckoo HashingDescriptionOne of the most fundamental data structure problems is the dictionary problem: given a set D of words you want to be able to ... 阅读全文
摘要：
先给个LCA模板HDU 1330(LCA模板)#include #include #define N 40005struct Edge{ int x,y,d,ne;};Edge e[N*2],e2[N*2];int be[N],be2[N],all,all2,n,m;bool vis[N];i... 阅读全文
摘要：
不说别的，直接上模板。Dinic+当前弧优化：struct Edge{ int x,y,c,ne;}e[M*2];int be[N],all;int d[N],q[N];int stack[N],top;//栈存的是边int cur[N];//当前弧优化void add(int x, int ... 阅读全文