https://blog.youkuaiyun.com/whj_limzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/whj_lim/article/details/77892267https://blog.youkuaiyun.com/whj_lim/article/details/77892267whj_limFri, 08 Sep 2017 11:11:35 +0800https://blog.youkuaiyun.com/whj_lim/article/details/48086747https://blog.youkuaiyun.com/whj_lim/article/details/48086747whj_limSat, 29 Aug 2015 13:30:05 +0800https://blog.youkuaiyun.com/whj_lim/article/details/48050743https://blog.youkuaiyun.com/whj_lim/article/details/48050743whj_limFri, 28 Aug 2015 13:05:47 +0800 #include #include #include #include #define oo 0x3f3f3f3f using namespace std; const int maxn = 1010; struct node { int c,f; }; in]]>https://blog.youkuaiyun.com/whj_lim/article/details/48036865https://blog.youkuaiyun.com/whj_lim/article/details/48036865whj_limThu, 27 Aug 2015 22:23:18 +0800 #include #include #include #include #define oo 0x3f3f3f3f const int maxn = 1010; using namespace std; struct point { int c,f; }; poi]]>https://blog.youkuaiyun.com/whj_lim/article/details/47706827https://blog.youkuaiyun.com/whj_lim/article/details/47706827whj_limSun, 16 Aug 2015 21:31:37 +0800 #include #include #include #include #include #includehttps://blog.youkuaiyun.com/whj_lim/article/details/47705817https://blog.youkuaiyun.com/whj_lim/article/details/47705817whj_limSun, 16 Aug 2015 20:22:15 +0800 #include #include #include #include #include #includehttps://blog.youkuaiyun.com/whj_lim/article/details/47700643https://blog.youkuaiyun.com/whj_lim/article/details/47700643whj_limSun, 16 Aug 2015 10:54:43 +0800 #include #include #include #includehttps://blog.youkuaiyun.com/whj_lim/article/details/47627155https://blog.youkuaiyun.com/whj_lim/article/details/47627155whj_limFri, 14 Aug 2015 00:01:22 +0800https://blog.youkuaiyun.com/whj_lim/article/details/47336315https://blog.youkuaiyun.com/whj_lim/article/details/47336315whj_limFri, 07 Aug 2015 11:15:02 +0800 #include #include #include typedef long long ll; const int maxn = 222; using namespace std; char a[maxn]; int b; vector ve; int Divisible() {]]>https://blog.youkuaiyun.com/whj_lim/article/details/47312813https://blog.youkuaiyun.com/whj_lim/article/details/47312813whj_limThu, 06 Aug 2015 10:34:39 +0800 #include #include #include #include #define Max(a,b) (a)>(b)?(a)]]>https://blog.youkuaiyun.com/whj_lim/article/details/47312723https://blog.youkuaiyun.com/whj_lim/article/details/47312723whj_limThu, 06 Aug 2015 10:31:10 +0800 #include #include #define Max(a,b) (a)>(b)?(a):(b) #define Min(a,b) (a)<(b)?(a):(b) const int maxn = 200010; using namespace]]>https://blog.youkuaiyun.com/whj_lim/article/details/47312617https://blog.youkuaiyun.com/whj_lim/article/details/47312617whj_limThu, 06 Aug 2015 10:26:38 +0800https://blog.youkuaiyun.com/whj_lim/article/details/47306277https://blog.youkuaiyun.com/whj_lim/article/details/47306277whj_limWed, 05 Aug 2015 23:29:57 +0800https://blog.youkuaiyun.com/whj_lim/article/details/47299309https://blog.youkuaiyun.com/whj_lim/article/details/47299309whj_limWed, 05 Aug 2015 16:24:33 +0800https://blog.youkuaiyun.com/whj_lim/article/details/47286527https://blog.youkuaiyun.com/whj_lim/article/details/47286527whj_limWed, 05 Aug 2015 00:55:05 +0800 dis[u][k] + dis[k][v] SPFA: 先距离为oo,起点为0， 入队列，标记在队列中，标记进入队列次数，取出点，遍历跟新]]>https://blog.youkuaiyun.com/whj_lim/article/details/47286429https://blog.youkuaiyun.com/whj_lim/article/details/47286429whj_limWed, 05 Aug 2015 00:50:37 +0800 #include #include<]]>https://blog.youkuaiyun.com/whj_lim/article/details/47281985https://blog.youkuaiyun.com/whj_lim/article/details/47281985whj_limTue, 04 Aug 2015 20:24:41 +0800 #include #include #define M]]>https://blog.youkuaiyun.com/whj_lim/article/details/47272789https://blog.youkuaiyun.com/whj_lim/article/details/47272789whj_limTue, 04 Aug 2015 10:11:35 +0800 #include #include #define oo 0x3f3f3f3f const int maxn = 2020; using name]]>https://blog.youkuaiyun.com/whj_lim/article/details/47208179https://blog.youkuaiyun.com/whj_lim/article/details/47208179whj_limSun, 02 Aug 2015 16:07:49 +0800=p，则说明这个区间都在+2c 如果区间最大伤害https://blog.youkuaiyun.com/whj_lim/article/details/47205141https://blog.youkuaiyun.com/whj_lim/article/details/47205141whj_limSun, 02 Aug 2015 10:35:50 +0800 const int maxn = 100010; using namespace std; int lazy[maxn<<2]; struct node { int l, r,d; }; node tree[maxn<<2]; int ans; void work(int rt) { tree[rt].d]]>