11 2014 档案

poj 3693 后缀数组求重复次数最多的连续重复子串
摘要：#include#include#include#include#include#include#include#include#include#include#include#include#define rep(i,n) for(int i=0;i=a;--i)#define PB push_b... 阅读全文

posted @ 2014-11-30 10:15 wanggp3 阅读(151) 评论(0) 推荐(0)

斯坦纳树模板
摘要：屌炸天阿什么东西都有 丢//斯坦纳树模板 让k个点联通的最小生成树 复杂度 n*3^k #include#include#include#include#include#include#include#include#include#include#include#include#define re... 阅读全文

posted @ 2014-11-29 00:32 wanggp3 阅读(219) 评论(0) 推荐(0)

DLX_e/m
摘要：// 精确覆盖#include#include#include#include#include#include#include#include#include#include#include#include#define rep(i,n) for(int i=0;i=a;--i)#define PB... 阅读全文

posted @ 2014-11-27 22:10 wanggp3 阅读(145) 评论(0) 推荐(0)

全局最小割（n^3)
摘要：#include#include#define rep(i,n) for(int i=0;iconst int N = 200;int n,m;int map[N][N],combine[N],vis[N],wet[N];int S,T,minCut;void init(){ memset(... 阅读全文

posted @ 2014-11-25 10:13 wanggp3 阅读(209) 评论(0) 推荐(0)

hdu 4467( 轻重点维护）
摘要：写了7000b代码 真是醉了#include #include #include #include #include #include #include #include #include #include #include #include #include #include using name... 阅读全文

posted @ 2014-11-23 23:44 wanggp3 阅读(219) 评论(0) 推荐(0)

HDU 4453 (splay 插入删除翻转区间加单点查）
摘要：//白色上的模板，先静态申请结构体数组，再动态使用，时间应该更快；还有个小技巧，它的空指针用真实的null指针代替，这样即使访问了null的内容也没关系，减少出错的可能性#include#include#includeusing namespace std;struct Node { Node *... 阅读全文

posted @ 2014-11-23 10:31 wanggp3 阅读(256) 评论(0) 推荐(0)

字符串最小表示法 O(N)
摘要：#include#include#include#define rep(i,n) for(int i=0;i= l ? i + k - l : i + k] - s[(j + k) >= l ? j + k - l : j + k]; if(!t) k++; ... 阅读全文

posted @ 2014-11-19 23:58 wanggp3 阅读(204) 评论(0) 推荐(0)

HDU 3950 线段树
摘要：#include#include#include#include#include#include#include#include#include#include#include#include#define rep(i,n) for(int i=0;i=a;--i)#define PB push_b... 阅读全文

posted @ 2014-11-17 09:55 wanggp3 阅读(212) 评论(0) 推荐(0)

在线二分求LCA
摘要：#pragma comment (linker,"/STACK:102400000,102400000")#include#include#include#include#include#include#include#include#include#include#include#include#... 阅读全文

posted @ 2014-11-01 09:17 wanggp3 阅读(131) 评论(0) 推荐(0)

导航