<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[蒟蒻的Bzoj记录]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Mmh2000</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Mmh2000]]></copyright><item><title><![CDATA[3238: [Ahoi2013]差异]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79733600</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79733600</guid><author>Mmh2000</author><pubDate>Wed, 28 Mar 2018 20:38:14 +0800</pubDate><description><![CDATA[题目链接

题目大意：一个长度为 n 的字符串 S，令TiTiT_i表示它从第 i 个字符开始的后缀，求 
∑1≤i&amp;lt;j≤nlen(Ti)+len(Tj)−2lcp(Ti,Tj)∑1≤i&amp;lt;j≤nlen(Ti)+len(Tj)−2lcp(Ti,Tj)\sum\limits_{1 \leq i ...]]></description><category></category></item><item><title><![CDATA[4552: [Tjoi2016&Heoi2016]排序]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79733457</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79733457</guid><author>Mmh2000</author><pubDate>Wed, 28 Mar 2018 20:29:59 +0800</pubDate><description><![CDATA[题目链接题目大意：维护一个1到n的排列，进行m次局部排序，最后求第 q 位置的数字题解：二分答案x，把序列变成a[i]≥xa[i] \geq x?1:0 
区间排序变成区间置0/1，维护区间0的个数就好了……我的收获：233#include <cstdio>
#define init int l = t[k].l, r = t[k].r, mid = (l + r) >> 1
const int m]]></description><category></category></item><item><title><![CDATA[2005: [Noi2010]能量采集]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79733354</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79733354</guid><author>Mmh2000</author><pubDate>Wed, 28 Mar 2018 20:23:47 +0800</pubDate><description><![CDATA[题目链接

题目大意：求∑x=1n∑y=1mgcd(x,y)∑x=1n∑y=1mgcd(x,y)\sum\limits_{x=1}^{n} \sum\limits_{y=1}^{m} gcd(x,y)

题解：点(x,y)与(0,0)所连线段上不包含原点有的点为gcd(x,y) 
反演或简单容斥都可以

我的收获：2333

#include &amp;lt;iostream&amp;gt;  
#include...]]></description><category></category></item><item><title><![CDATA[2428: [HAOI2006]均分数据]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79733272</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79733272</guid><author>Mmh2000</author><pubDate>Wed, 28 Mar 2018 20:19:20 +0800</pubDate><description><![CDATA[题目链接题目大意：把 n 个正整数分成 m 组，最小化各组的均方差题解：模拟退火2333我的收获：2333#include <cstdio>
#include <cmath>
#include <algorithm>using namespace std;
typedef double lf;
const int N = 25;int n, m;
lf mid, ans;
int a[N], p[N]]></description><category></category></item><item><title><![CDATA[1502: [NOI2005]月下柠檬树]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79733240</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79733240</guid><author>Mmh2000</author><pubDate>Wed, 28 Mar 2018 20:17:11 +0800</pubDate><description><![CDATA[题目链接题目大意：有一个由圆锥和圆台组成的柠檬树，在月亮发出的平行光下，可以形成一个影子，求这个影子的面积题解：自适应辛普森积分……我的收获：2333#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
const double eps=]]></description><category></category></item><item><title><![CDATA[3163: [Heoi2013]Eden的新背包问题]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79733203</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79733203</guid><author>Mmh2000</author><pubDate>Wed, 28 Mar 2018 20:14:57 +0800</pubDate><description><![CDATA[题目链接题目大意：现在有n个物品，第i个物品有c[i]个，每购买第i个物品一个需要a[i]元，可获b[i]代价。  
有m个询问，每次询问形如：第x个物品禁止购买，你有y元的话，你能获得的最大价值是多少？询问之间互相独立。 题解：CDQ分治 
Solve(l,r)表示，当前维护的dp数组，记录的答案是除去[l,r]外的物品的答案 
Solve(l,mid)时，用[mid+1,r]内的物品转移dp数组]]></description><category></category></item><item><title><![CDATA[4565: [Haoi2016]字符合并]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79711196</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79711196</guid><author>Mmh2000</author><pubDate>Tue, 27 Mar 2018 12:18:32 +0800</pubDate><description><![CDATA[题目链接题目大意：有一个长度为 n 的 01 串，你可以每次将相邻的 k 个字符合并，得到一个新的字符并获得一定分数。得到的新字 
符和分数由这 k 个字符确定。你需要求出你能获得的最大分数题解：区间+状压dp 
细节见此我的收获：#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include]]></description><category></category></item><item><title><![CDATA[3706: 反色刷]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79131519</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79131519</guid><author>Mmh2000</author><pubDate>Tue, 27 Mar 2018 07:55:20 +0800</pubDate><description><![CDATA[题目链接

题目大意：给出一个n个点m条边的无向图，每一条边有一个颜色0/1，每一次可以选择一个环（不一定是简单环）使环上的所有边都反色。问最少选择多少次使所有的边都变成白色。这个图的边的颜色会发生变化，每一次操作有可能使一条边反色

题解：

性质1：

性质2：

我的收获：



#include 
#include 
#include 
#include 
#include 

using]]></description><category></category></item><item><title><![CDATA[1500: [NOI2005]维修数列]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79703265</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79703265</guid><author>Mmh2000</author><pubDate>Mon, 26 Mar 2018 20:09:24 +0800</pubDate><description><![CDATA[题目链接题目大意：维护一个数列，支持一堆操作（懒得写了）题解：上fhq treap……我的收获：2333#include <cstdio>
#include <queue>
#include <cstdlib>
using namespace std;#define N 500010
#define INF 0x3f3f3f3fint n,m,root,cnt;
int ch[N][2],siz[N]]></description><category></category></item><item><title><![CDATA[3817: Sum]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79702899</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79702899</guid><author>Mmh2000</author><pubDate>Mon, 26 Mar 2018 19:43:56 +0800</pubDate><description><![CDATA[题目链接题目大意：给定正整数N，R；求∑d=1n(−1)⌊d×r×d⌋\sum\limits_{d=1}^{n}(-1)^{\lfloor d \times r \times d \rfloor }题解：膜CA我的收获：经典套路#include <bits/stdc++.h>
using namespace std;typedef long long ll;int T;
ll n,r;
double]]></description><category></category></item><item><title><![CDATA[2795: [Poi2012]A Horrible Poem]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79702523</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79702523</guid><author>Mmh2000</author><pubDate>Mon, 26 Mar 2018 19:19:28 +0800</pubDate><description><![CDATA[题目链接题目大意：给出一个长度为N的字符串，有Q次询问； 
每次询问给出一个区间，求区间最短循环节长度题解：膜一发GXZ大爷我的收获：循环节……e#include<bits/stdc++.h>
using namespace std;typedef unsigned long long ull;const int N=500009;
const ull B=1000173169;int n,q;
i]]></description><category></category></item><item><title><![CDATA[1901: Zju2112 Dynamic Rankings]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79702393</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79702393</guid><author>Mmh2000</author><pubDate>Mon, 26 Mar 2018 19:07:33 +0800</pubDate><description><![CDATA[题目链接题目大意：区间k大，支持单点修改题解：带修主席树模板我的收获：233#include <bits/stdc++.h>
using namespace std;#define N 10005int n,m,top,cnt,tot;
int v[N],num[N<<1];
int A[N],B[N],K[N],flag[N];
int root[N],L[55],R[55];inline int]]></description><category></category></item><item><title><![CDATA[3124: [Sdoi2013]直径]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79696311</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79696311</guid><author>Mmh2000</author><pubDate>Mon, 26 Mar 2018 12:11:20 +0800</pubDate><description><![CDATA[题目链接题目大意：给定一棵树，求直径的长度以及有多少条边满足所有的直径都经过该边题解：丢题解跑……我的收获：分析性质……emmmmm#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define FOR(]]></description><category></category></item><item><title><![CDATA[4530: [Bjoi2014]大融合]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79696117</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79696117</guid><author>Mmh2000</author><pubDate>Mon, 26 Mar 2018 11:51:18 +0800</pubDate><description><![CDATA[题目链接题目大意：一棵树，动态加边，询问经过一条边的路径条数题解：LCT 维护子树信息我的收获：2333#include <bits/stdc++.h>
using namespace std;#define ls c[x][0]
#define rs c[x][1]const int N=1e5+10;int n,q;
int c[N][2],fa[N],size[N],sum[N],stk[N]]]></description><category></category></item><item><title><![CDATA[3944: Sum]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79696011</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79696011</guid><author>Mmh2000</author><pubDate>Mon, 26 Mar 2018 11:43:22 +0800</pubDate><description><![CDATA[题目链接题目大意：求∑φ\sum \varphi 和∑μ\sum \mu题解：杜教筛模板我的收获：2333#include<iostream>
#include<cstdio>
#include<cstring>
#define ll long long
using namespace std;int cas,n,m,cnt,c[1000005]; ll phi[2000005],mu[200000]]></description><category></category></item><item><title><![CDATA[3209: 花神的数论题]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79691248</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79691248</guid><author>Mmh2000</author><pubDate>Sun, 25 Mar 2018 21:54:53 +0800</pubDate><description><![CDATA[35]]></description><category></category></item><item><title><![CDATA[3143: [Hnoi2013]游走]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79691227</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79691227</guid><author>Mmh2000</author><pubDate>Sun, 25 Mar 2018 21:52:42 +0800</pubDate><description><![CDATA[题目链接题目大意：在一个无向连通图上随机游走，初始在1，每一步等概率选择某条出边走到下一个顶点，获得等于这条边的编号的分数；到达 n 结束 
对边进行编号，最小化期望总分题解：详细的题解……我的收获：各种转化……妙啊#include<cstdio>
#include<algorithm>
#define N 502
#define M 202222
int n,m,i,x,y,du[N],n1[M]]]></description><category></category></item><item><title><![CDATA[2115: [Wc2011] Xor]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79691036</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79691036</guid><author>Mmh2000</author><pubDate>Sun, 25 Mar 2018 21:38:05 +0800</pubDate><description><![CDATA[题目链接题目大意：给定一幅边权非负的无向连通图,求一条从1到n的路径,使得路径上边权的异或和最大(不需要是简单路径)题解：dfs处理出1到每个点的任意一条路径的边权的异或和,同时处理出图中所有环的边权异或和发现把1到n的任意一条路径的异或值与任意个环的异或值求异或就可以得到所有1到n的路径的异或和……然后是经典线性基了我的收获：2333#include <cstdio>
#include <cstr]]></description><category></category></item><item><title><![CDATA[2844: albus就是要第一个出场]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79683891</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79683891</guid><author>Mmh2000</author><pubDate>Sun, 25 Mar 2018 09:29:55 +0800</pubDate><description><![CDATA[题目链接题目大意：给定一个 n 个数的集合 S 和一个数 x ,求 x 在 S 的2n2^n个子集从小到大的异或和序列中最早出现的位置题解：考虑一个结论：对于一个n个数构成的大小为 k 的线性基 
可以得到的2k2^k个异或和每个会重复2n−k2^{n-k}次从高到低枚举二进制位，异或这一位后小于 k 就加上我的收获：2333#include <iostream>
#include <cstdio>]]></description><category></category></item><item><title><![CDATA[2821: 作诗(Poetize)]]></title><link>https://blog.youkuaiyun.com/Mmh2000/article/details/79683680</link><guid>https://blog.youkuaiyun.com/Mmh2000/article/details/79683680</guid><author>Mmh2000</author><pubDate>Sun, 25 Mar 2018 08:42:19 +0800</pubDate><description><![CDATA[题目链接题目大意：N个数，M组询问，每次问[l,r]中有多少个数出现正偶数次，强制在线题解：经典分块 
预处理ans[i][j]ans[i][j]表示第 i 块到第 j 块的答案 
sum[i][j]sum[i][j]表示前 j 块中元素 i 出现的次数我的收获：2333#include <cstdio>
#include <vector>
#include <map>
#include <cmat]]></description><category></category></item></channel></rss>