图论
文章平均质量分 73
Lethelody
这个作者很懒,什么都没留下…
展开
-
BZOJ1491【floyd】
跑floyd的时候顺便统计一下最短路的方案数./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#includetypedef long long LL;原创 2015-03-31 23:55:40 · 375 阅读 · 0 评论 -
BZOJ3571【最小乘积最大匹配】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-04-25 20:21:26 · 563 阅读 · 0 评论 -
BZOJ3890【A*算法】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-04-27 15:14:27 · 642 阅读 · 0 评论 -
BZOJ4012【拓扑排序】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-05-02 15:58:50 · 902 阅读 · 0 评论 -
Codeforces 545E【最小树形图】
/* I will wait for you */#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-05-20 16:47:19 · 868 阅读 · 0 评论 -
POJ1635【树的同构】【hash】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-05-27 11:00:30 · 505 阅读 · 0 评论 -
BZOJ2753【最小树形图】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-05-21 11:03:22 · 630 阅读 · 0 评论 -
BZOJ1975【左偏树】
卡Priority_queue的内存简直是不忍直视./* I will wait for you */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #def原创 2015-07-12 11:35:38 · 1552 阅读 · 0 评论 -
POJ2449【A*算法】【可持久化左偏树】
K短路模板题.K很小所以A*就可以过了./* I will wait for you */#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define mak原创 2015-07-12 11:31:28 · 1523 阅读 · 0 评论 -
BZOJ2395【最小乘积生成树】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-04-25 15:49:43 · 507 阅读 · 0 评论 -
BZOJ3624【生成树】
/* I will wait for you */ #include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make(a,b) make_pair(a,b)#define fi fi原创 2015-04-17 12:13:11 · 498 阅读 · 0 评论 -
BZOJ3931【最大流】【SPFA】
/* I will wait for you */ #include #include #include #include #include #include #include #include #include #include #include #include原创 2015-04-16 11:18:11 · 500 阅读 · 0 评论 -
BZOJ1179【tarjan】【spfa】
tarjan缩点.然后用spfa找最长路./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair#原创 2015-04-07 01:03:01 · 516 阅读 · 0 评论 -
BZOJ1143【floyd】【二分图匹配】
先用folyd求出传递闭包.答案就是总点数减去最大匹配.似乎就是可共用节点的最小路径覆盖./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include原创 2015-04-07 20:30:01 · 365 阅读 · 0 评论 -
BZOJ1529【DFS】
/* I will wait for you */ #include#include#include#include using namespace std; typedef long long LL;typedef unsigned long long ULL;typedef pair PII; const int maxn=2000010;const int max原创 2015-04-12 11:36:28 · 506 阅读 · 0 评论 -
BZOJ1103【树状数组】
运用树的dfs序的性质差分.据说要写人工栈./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair原创 2015-04-07 20:19:19 · 444 阅读 · 0 评论 -
BZOJ1102【BFS】
/* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make(a,b) make_pair(a,b)#define fi fir原创 2015-04-08 01:16:10 · 487 阅读 · 0 评论 -
BZOJ1097【状压DP】
/* I will wait for you */#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-04-14 01:32:51 · 496 阅读 · 0 评论 -
BZOJ3207【暴力】
/* I will wait for you */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #原创 2015-04-14 11:37:29 · 425 阅读 · 0 评论 -
BZOJ3210【曼哈顿距离】
运用【曼哈顿距离变形】的逆变换./* I will wait for you */ #include #include #include #include #include #include #include #include #include #include #include #include #includ原创 2015-04-14 17:20:12 · 579 阅读 · 0 评论 -
BZOJ4016【最短路】【点分治】
/* I will wait for you */#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make(a,b) make_pair(a,b)原创 2015-07-08 18:31:02 · 1441 阅读 · 0 评论