12 2014 档案

树链剖分
摘要：#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-12-03 23:05 wanggp3 阅读(156) 评论(0) 推荐(0)

hdu 4127 （IDA* 搜索）
摘要：#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-12-02 10:28 wanggp3 阅读(164) 评论(0) 推荐(0)

poj 2449 k短路模板（有环）
摘要：#include #include #include #include #include using namespace std;const int maxn = 1000 + 10;const int INF = 1E[maxn], W[maxn], Ek[maxn], Wk[maxn];int ... 阅读全文

posted @ 2014-12-02 10:26 wanggp3 阅读(151) 评论(0) 推荐(0)

poj 1741 树分治
摘要：#include#include#include#include#include#include#include#include#include#include#include#include#include#define rep(i,n) for(int i=0;i=(a);i--)#define... 阅读全文

posted @ 2014-12-02 10:24 wanggp3 阅读(146) 评论(0) 推荐(0)

导航