https://blog.youkuaiyun.com/yohanlongzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/yohanlong/article/details/53144433https://blog.youkuaiyun.com/yohanlong/article/details/53144433yohanlongSat, 12 Nov 2016 23:17:09 +0800 #include #include using namespace std; #define root 1,n,1 #define ls l,m,o<<1 #define rs m+1,r,o<<1|1 inline void read(int&]]>https://blog.youkuaiyun.com/yohanlong/article/details/53139396https://blog.youkuaiyun.com/yohanlong/article/details/53139396yohanlongSat, 12 Nov 2016 12:40:29 +0800https://blog.youkuaiyun.com/yohanlong/article/details/53138449https://blog.youkuaiyun.com/yohanlong/article/details/53138449yohanlongSat, 12 Nov 2016 10:20:53 +0800https://blog.youkuaiyun.com/yohanlong/article/details/53130928https://blog.youkuaiyun.com/yohanlong/article/details/53130928yohanlongFri, 11 Nov 2016 17:47:02 +0800 using namespace std; int a[6]={0,5,2,1,4,3}; int c[6]; int lowbit(int x){ return x&(-x); } void update(int pos,int val){ while(pos<=5){]]>https://blog.youkuaiyun.com/yohanlong/article/details/53123920https://blog.youkuaiyun.com/yohanlong/article/details/53123920yohanlongFri, 11 Nov 2016 00:10:12 +0800https://blog.youkuaiyun.com/yohanlong/article/details/53101761https://blog.youkuaiyun.com/yohanlong/article/details/53101761yohanlongWed, 09 Nov 2016 16:48:53 +0800在下标 pos 处加上 x query（pos）->返回 1 到 pos 的前缀和 那么查询区间 [ l , r ]的操作就是query( r ) - query( l - 1 )例题——洛谷3374代码#include #include #include #includehttps://blog.youkuaiyun.com/yohanlong/article/details/53032701https://blog.youkuaiyun.com/yohanlong/article/details/53032701yohanlongFri, 04 Nov 2016 10:52:26 +0800dfn[u])判断。 然后对于每一个操作，判断要加的两个点在不在一个双连通分量，如果在一个双连通分量里面，不用进行任何操作（这样加边不会减少桥）；]]>https://blog.youkuaiyun.com/yohanlong/article/details/52884984https://blog.youkuaiyun.com/yohanlong/article/details/52884984yohanlongFri, 21 Oct 2016 16:44:01 +0800https://blog.youkuaiyun.com/yohanlong/article/details/52876635https://blog.youkuaiyun.com/yohanlong/article/details/52876635yohanlongThu, 20 Oct 2016 20:28:18 +0800https://blog.youkuaiyun.com/yohanlong/article/details/52876231https://blog.youkuaiyun.com/yohanlong/article/details/52876231yohanlongThu, 20 Oct 2016 19:43:09 +0800https://blog.youkuaiyun.com/yohanlong/article/details/52876123https://blog.youkuaiyun.com/yohanlong/article/details/52876123yohanlongThu, 20 Oct 2016 19:30:05 +0800https://blog.youkuaiyun.com/yohanlong/article/details/50620647https://blog.youkuaiyun.com/yohanlong/article/details/50620647yohanlongMon, 01 Feb 2016 21:52:39 +0800https://blog.youkuaiyun.com/yohanlong/article/details/50605678https://blog.youkuaiyun.com/yohanlong/article/details/50605678yohanlongFri, 29 Jan 2016 10:38:52 +0800