<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[xuziling_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/xuziling_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xuziling_]]></copyright><item><title><![CDATA[【模拟+数学】Codeforces Round #621 (Div. 1 + Div. 2)  1307E Cow and Treats]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/104446187</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/104446187</guid><author>xuziling_</author><pubDate>Sat, 22 Feb 2020 23:24:32 +0800</pubDate><description><![CDATA[Cow and Treats
【cf链接】
After a successful year of milk production, Farmer John is rewarding his cows with their favorite treat: tasty grass!
On the field, there is a row of n units of grass, each with ...]]></description><category></category></item><item><title><![CDATA[用平均数和标准差mock数据并保留两位小数]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/104284189</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/104284189</guid><author>xuziling_</author><pubDate>Wed, 12 Feb 2020 20:20:54 +0800</pubDate><description><![CDATA[复现论文的时候需要mock正态分布的数据，论文里只有带误差线的柱状图，如下图

百度+猜测认为误差线是平均值±标准差
用PDF快速看图量了一下，官网链接点这里

excel公式为
=NORMINV(RAND(),$D2,$E2)

其中D2是均值，E2是标准差，接下来只要复制就会有一系列数据了。
最后复制粘贴到原位置只保留值，再用excel的“减小小数位数”就ok了。
以上如果有错误请留言，谢谢！...]]></description><category></category></item><item><title><![CDATA[【dp+超巧妙的线段树】codeforces 1197E. Culture Code]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/97495562</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/97495562</guid><author>xuziling_</author><pubDate>Sat, 27 Jul 2019 11:50:59 +0800</pubDate><description><![CDATA[【dp+超巧妙的线段树】codeforces 1197E. Culture Code
【题目链接】

题目
There are famous Russian nesting dolls named matryoshkas sold in one of the souvenir stores nearby, and you’d like to buy several of them. The sto...]]></description><category></category></item><item><title><![CDATA[【数位dp】求不超过n的数中，有多少个包含2018]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/89207267</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/89207267</guid><author>xuziling_</author><pubDate>Thu, 11 Apr 2019 12:13:00 +0800</pubDate><description><![CDATA[【数位dp】求不超过n的数中，有多少个包含2018
n的范围是[0,1e9];
包含2018的意思是2018是该数的子序列，比如200176855,32018,5270168是符合条件的数， 2019，40017是不符合条件的数。
Sample Input
2018
Sample Input
1
Sample Input
20182018
Sample Input
92237

解题思路
数位dp...]]></description><category></category></item><item><title><![CDATA[WHU校赛2019 Online F. Climb（树上主席树）]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/89074270</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/89074270</guid><author>xuziling_</author><pubDate>Sun, 07 Apr 2019 20:11:39 +0800</pubDate><description><![CDATA[WHU校赛2019 Online F. Climb
[没有链接]

题目
JBT is going to climb the mountain, but he was suddenly trapped into an unknown enchantment.
There are n mountains, connected by n−1 paths. There is only one road ...]]></description><category></category></item><item><title><![CDATA[HDU - 6000 Wash  贪心+优先队列]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/84204140</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/84204140</guid><author>xuziling_</author><pubDate>Sun, 18 Nov 2018 20:22:34 +0800</pubDate><description><![CDATA[HDU - 6000 Wash  贪心+优先队列
【vj链接】

题目
Mr.Panda is about to engage in his favourite activity doing laundry! He’s brought L indistinguishable loads of laundry to his local laundromat, which has N washing ...]]></description><category></category></item><item><title><![CDATA[【机智的图论】牛客2018多校第十场 F. Rikka with Line Graph]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81911600</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81911600</guid><author>xuziling_</author><pubDate>Tue, 21 Aug 2018 17:33:27 +0800</pubDate><description><![CDATA[【机智的图论】牛客2018多校第十场 F. Rikka with Line Graph

【题目链接】





题目描述

Line Graph L(G) can be considered as an operator on an undirected graph G just like Complementary Graph and Dual Graph.

Rikka generalize...]]></description><category></category></item><item><title><![CDATA[【二分+状压dp】Codeforces Round #384 (Div. 2) E. Vladik and cards]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81745894</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81745894</guid><author>xuziling_</author><pubDate>Thu, 16 Aug 2018 17:34:43 +0800</pubDate><description><![CDATA[【二分+状压dp】Codeforces Round #384 (Div. 2) E. Vladik and cards

【vj链接】



题目

Vladik was bored on his way home and decided to play the following game. He took n cards and put them in a row in front of hi...]]></description><category></category></item><item><title><![CDATA[【动态主席树，带lazy标记的区间更新求和】HDU - 4348 To the moon]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81588967</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81588967</guid><author>xuziling_</author><pubDate>Sat, 11 Aug 2018 17:36:30 +0800</pubDate><description><![CDATA[【动态主席树，带lazy标记的区间更新求和】HDU - 4348 To the moon

【vj链接】





题目

Background  
To The Moon is a independent game released in November 2011, it is a role-playing adventure game powered by RPG Maker.  
The ...]]></description><category></category></item><item><title><![CDATA[【动态主席树】 ZOJ 2112 Dynamic Rankings]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81566551</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81566551</guid><author>xuziling_</author><pubDate>Fri, 10 Aug 2018 17:06:12 +0800</pubDate><description><![CDATA[【动态主席树】 ZOJ 2112 Dynamic Rankings

【vj链接】





题目

求区间第k小，有单点更新

输入

T组数据
n个点Q个询问
n个点
Q行Q个询问
  以Q开头的三个数 l r k 表示询问 [l,r] 第 k 小
  以C开头的俩数x y 表示把 a[x] 换成 y


输出每个询问对应的第 k 小的数

Sample Input

2
5 3
3 2 1 ...]]></description><category></category></item><item><title><![CDATA[【神奇的dp】poj 6357 Hills And Valleys]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81477064</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81477064</guid><author>xuziling_</author><pubDate>Tue, 07 Aug 2018 10:43:07 +0800</pubDate><description><![CDATA[【神奇的dp】poj 6357 Hills And Valleys

【题目链接】



题目

Problem Description

Tauren has an integer sequence A of length n (1-based). He wants you to invert an interval [l,r] (1≤l≤r≤n) of A (i.e. replace Al,A...]]></description><category></category></item><item><title><![CDATA[【求最长公共前缀 后缀数组】hdu1403]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81449667</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81449667</guid><author>xuziling_</author><pubDate>Mon, 06 Aug 2018 10:13:49 +0800</pubDate><description><![CDATA[【求最长公共前缀 后缀数组】hdu1403

【vj链接】





题目内容

给两个字符串，求最长公共子串，多组数据，长度1e5

解题思路

利用后缀数组的性质，把两个串连起来，找最大的满足公共串部分分别在两个字符串里的height。





AC代码

#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstri...]]></description><category></category></item><item><title><![CDATA[【分块dp】HDU 6331 Problem M. Walking Plan]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81304765</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81304765</guid><author>xuziling_</author><pubDate>Tue, 31 Jul 2018 15:45:05 +0800</pubDate><description><![CDATA[【分块dp】HDU 6331 Problem M. Walking Plan

【题目链接】



题目大意

T组数据 
每组n个点m条边，给一个有向图，边有长度。 
接下来Q个询问 
每次问u到v至少经过x个点的最短距离



Input

The first line of the input contains an integer T(1≤T≤10), denoting the numbe...]]></description><category></category></item><item><title><![CDATA[【dfs 组合数】code forces 991E Bus Number]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81196108</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81196108</guid><author>xuziling_</author><pubDate>Wed, 25 Jul 2018 09:26:02 +0800</pubDate><description><![CDATA[【dfs 组合数】code forces 991E Bus Number

【题目链接】



题目内容

给一个看到的数n(1&amp;amp;lt;=n&amp;amp;lt;=1e18)，无前导0，求实际的数x有多少种可能。 
n与x的关系是，

1.n中出现的数，x中也出现。
2.x中任何一个数出现的次数不超过其在n中出现的次数。






解题思路

1e18范围内最多就只有19个数，先把0,1,2……的数量都统计出...]]></description><category></category></item><item><title><![CDATA[【矩阵快速幂】code forces 631E]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81192492</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81192492</guid><author>xuziling_</author><pubDate>Tue, 24 Jul 2018 21:12:17 +0800</pubDate><description><![CDATA[【矩阵快速幂】code forces 631E

【题目链接】





题目内容

There are b blocks of digits. Each one consisting of the same n digits, which are given to you in the input. Wet Shark must choose exactly one digit from eac...]]></description><category></category></item><item><title><![CDATA[POJ 1742 coins （奇怪的多重背包）]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/81144566</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/81144566</guid><author>xuziling_</author><pubDate>Sat, 21 Jul 2018 14:41:44 +0800</pubDate><description><![CDATA[题目

给出n种货币和货币数量，求其能凑出的不超过m的和有多少种。



Input

The input contains several test cases. The first line of each test case contains two integers n(1&amp;lt;=n&amp;lt;=100),m(m&amp;lt;=100000).The second line contains 2n...]]></description><category></category></item><item><title><![CDATA[codeforces 500E New Year Domino(线段树预处理+倍增）]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/80584043</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/80584043</guid><author>xuziling_</author><pubDate>Tue, 05 Jun 2018 17:04:58 +0800</pubDate><description><![CDATA[codeforces 500E New Year Domino(线段树预处理+倍增）

【题目链接】



解题思路

先用线段树预处理能达到的最远长度，就是从后往前，对每个点，二分找到它能到的最远的木棒，找到这其中的最远距离，更新。 
对每一个点，向推倒它之后第一个不能被波及到的木棒连一条边，记录一个花费。 
用dp[i][j]表示第i个点走过2的j次方条边后到达的点，同时记录花费。

 dp[...]]></description><category></category></item><item><title><![CDATA[POJ - 2481 Cows （单点更新，区间查询（求和）的树状数组）]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/80405257</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/80405257</guid><author>xuziling_</author><pubDate>Tue, 22 May 2018 14:27:01 +0800</pubDate><description><![CDATA[POJ - 2481 Cows （单点更新，区间查询（求和）的树状数组）

【vj链接】



题目

Farmer John’s cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in h...]]></description><category></category></item><item><title><![CDATA[HDU - 2665 Kth number  （主席树经典题，求区间第K小）]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/80369630</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/80369630</guid><author>xuziling_</author><pubDate>Fri, 18 May 2018 21:26:22 +0800</pubDate><description><![CDATA[HDU - 2665 Kth number  （主席树经典题，求区间第K小）

【题目链接】

【大佬博客链接】



题目

Give you a sequence and ask you the kth big number of a inteval. 
Input 
The first line is the number of the test cases.  
For each test...]]></description><category></category></item><item><title><![CDATA[2018华科校赛A题 -- Beauty of Trees（带权并查集）]]></title><link>https://blog.youkuaiyun.com/xuziling_/article/details/80273800</link><guid>https://blog.youkuaiyun.com/xuziling_/article/details/80273800</guid><author>xuziling_</author><pubDate>Thu, 10 May 2018 21:13:27 +0800</pubDate><description><![CDATA[2018华科校赛A题 – Beauty of Trees（带权并查集）

【题目链接】



题目描述

It’s universally acknowledged that there’re innumerable trees in the campus of HUST. 
One day the tree manager wants to play a game with you. There...]]></description><category></category></item></channel></rss>