https://blog.youkuaiyun.com/MATHsqxzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/MATHsqx/article/details/55517682https://blog.youkuaiyun.com/MATHsqx/article/details/55517682MATHsqxFri, 17 Feb 2017 17:13:56 +0800 #define LL long long using namespace std;LL a[100003],//原数列 tree[400003],//线段树 delta[400003];//标记void update(int now) {//用儿子们来更新自己 tree[now]=tree[now<<1]+tr]]>https://blog.youkuaiyun.com/MATHsqx/article/details/54709371https://blog.youkuaiyun.com/MATHsqx/article/details/54709371MATHsqxTue, 24 Jan 2017 17:50:39 +0800 using namespace std;char s[1000003]; int len, cc[1000003], rank[1000003],//从第x位开始的后缀排第几 height[1000003],//跟排名前一位的字符串有]]>https://blog.youkuaiyun.com/MATHsqx/article/details/54646888https://blog.youkuaiyun.com/MATHsqx/article/details/54646888MATHsqxSat, 21 Jan 2017 18:15:03 +0800 using namespace std;int n,//点数 m,//操作数 C[500003],//树状数组 //树状数组用以求前缀和 a[500003];//原数列 void add(int loc,]]>https://blog.youkuaiyun.com/MATHsqx/article/details/54646815https://blog.youkuaiyun.com/MATHsqx/article/details/54646815MATHsqxSat, 21 Jan 2017 17:50:31 +0800 using namespace std;int n,//点数 m,//操作数 C[500000];//树状数组 void add(int loc,int value) {//单点修改 for(int i=loc;i<=n;i+=i&(-i)) C[i]+=value; }int query(int l]]>https://blog.youkuaiyun.com/MATHsqx/article/details/54024615https://blog.youkuaiyun.com/MATHsqx/article/details/54024615MATHsqxWed, 04 Jan 2017 21:41:16 +0800>右移——判断a第i位是否为1 (1<<(i-1))&a将a第i位更改成1 a|(1<<(i-1))删除a最靠右的1 a&(a-1)]]>https://blog.youkuaiyun.com/MATHsqx/article/details/54024386https://blog.youkuaiyun.com/MATHsqx/article/details/54024386MATHsqxWed, 04 Jan 2017 21:14:12 +0800https://blog.youkuaiyun.com/MATHsqx/article/details/53982113https://blog.youkuaiyun.com/MATHsqx/article/details/53982113MATHsqxMon, 02 Jan 2017 20:48:25 +0800https://blog.youkuaiyun.com/MATHsqx/article/details/53981354https://blog.youkuaiyun.com/MATHsqx/article/details/53981354MATHsqxMon, 02 Jan 2017 19:04:19 +0800https://blog.youkuaiyun.com/MATHsqx/article/details/53910477https://blog.youkuaiyun.com/MATHsqx/article/details/53910477MATHsqxWed, 28 Dec 2016 17:09:39 +0800 11 7 –> 4 7 –> 4 3 –> 1 3 –> 1 0 选手1取 选手2取 选手1取 选手2取 选手1取]]>https://blog.youkuaiyun.com/MATHsqx/article/details/53909865https://blog.youkuaiyun.com/MATHsqx/article/details/53909865MATHsqxWed, 28 Dec 2016 16:40:18 +0800https://blog.youkuaiyun.com/MATHsqx/article/details/53909829https://blog.youkuaiyun.com/MATHsqx/article/details/53909829MATHsqxWed, 28 Dec 2016 16:38:32 +0800https://blog.youkuaiyun.com/MATHsqx/article/details/53909795https://blog.youkuaiyun.com/MATHsqx/article/details/53909795MATHsqxWed, 28 Dec 2016 16:35:59 +0800 #include using namespace std;int r,c; i]]>https://blog.youkuaiyun.com/MATHsqx/article/details/53909744https://blog.youkuaiyun.com/MATHsqx/article/details/53909744MATHsqxWed, 28 Dec 2016 16:33:07 +0800https://blog.youkuaiyun.com/MATHsqx/article/details/53909696https://blog.youkuaiyun.com/MATHsqx/article/details/53909696MATHsqxWed, 28 Dec 2016 16:29:27 +0800