<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chihiro的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/CCchengzi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; CCchengzi]]></copyright><item><title><![CDATA[二叉树的判断]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/108158726</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/108158726</guid><author>CCchengzi</author><pubDate>Fri, 21 Aug 2020 21:54:03 +0800</pubDate><description><![CDATA[判断给定的二叉树是否为二叉排序树
//根据中序遍历序列一定是一个递增有序的序列来判断
int pre=INT_MIN;//保存当前节点中序前驱的值
bool check(BiTree bt){
	if(T==NULL)return true;
	if(check(bt-&gt;lchild) &amp;&amp; bt-&gt;data&gt;pre){
		pre=bt-&gt;data;
	} else return false;
	return check(bt-&gt;rchild);
}

判断给]]></description><category></category></item><item><title><![CDATA[牛客练习赛53-B(美味果冻)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/102729842</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/102729842</guid><author>CCchengzi</author><pubDate>Thu, 24 Oct 2019 19:14:33 +0800</pubDate><description><![CDATA[牛客练习赛53-B(美味果冻)
传送门
题意：计算∑i=1n∑j=1ii∗⌊ij⌋j\sum_{i=1}^{n}\sum_{j=1}^{i}i*{\lfloor\frac{i}{j}\rfloor}^j∑i=1n​∑j=1i​i∗⌊ji​⌋j对1e+71e+71e+7取模
//分块一下，注意直接使用快速幂计算乘方会超时，可以使用数组预处理出来
#include&lt;bits/stdc++.h&g...]]></description><category></category></item><item><title><![CDATA[牛客练习赛53-C( 富豪凯匹配串)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/102709352</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/102709352</guid><author>CCchengzi</author><pubDate>Wed, 23 Oct 2019 19:36:39 +0800</pubDate><description><![CDATA[牛客练习赛53-C( 富豪凯匹配串)
传送门
//使用bitset优化一下~
#include&lt;bits/stdc++.h&gt;
using namespace std;
const int N=1009;

int n,m;
string s;
bitset&lt;N&gt;a[N],s1,s2;


int main()
{
    ios::sync_with_stdio(false...]]></description><category></category></item><item><title><![CDATA[HDU-6531-Beautiful Now( 2018 Multi-University Training Contest 5)(dfs)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/102673371</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/102673371</guid><author>CCchengzi</author><pubDate>Mon, 21 Oct 2019 22:20:15 +0800</pubDate><description><![CDATA[HDU-6531-Beautiful Now( 2018 Multi-University Training Contest 5)(dfs)
传送门
题意：给你一个数n，每次可以选择n的两个位并交换它们的位置，问交换k次之后，n的最小值和最大值分别是多少(1&lt;=n,k&lt;=1e9)
思路：首先想到当k大于等于n的位数-1时，该数位数能交换一遍，此时应该是所有排列的最小值和最大值(注意前导...]]></description><category></category></item><item><title><![CDATA[CF1214E-Petya and Construction Set(树上构造)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100903427</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100903427</guid><author>CCchengzi</author><pubDate>Mon, 16 Sep 2019 21:59:47 +0800</pubDate><description><![CDATA[CF1214E-Petya and Construction Set(树上构造)
题目传送门
题意：首先给你一个n(1&lt;=n&lt;=1e5)，接着输入n个数，第 i 个数 di(1&amp;lt;=di&amp;lt;=n)d_i(1&amp;lt;=d_i&amp;lt;=n)di​(1&lt;=di​&lt;=n) 表示点
i∗2i*2i∗2 和点 i∗2−1i*2-1i∗2−1 之间...]]></description><category></category></item><item><title><![CDATA[配置tomcat自带的数据库连接池jdbc pool(sql sever版)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100868997</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100868997</guid><author>CCchengzi</author><pubDate>Mon, 16 Sep 2019 00:18:32 +0800</pubDate><description><![CDATA[配置tomcat自带的数据库连接池jdbc pool(sql sever版)
tomcat jdbc pool 可在tomcat全局中直接使用，也可以在独立的应用中使用
在tomcat全局中使用:
1.首先，进入你的tomcat的安装目录下conf目录下的context.xml文件，在其中添加数据库源配置
&lt;Resource
        name="jdbc/sql2000ds" 
  ...]]></description><category></category></item><item><title><![CDATA[牛客小白月赛17-G区间求和(莫队)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100831383</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100831383</guid><author>CCchengzi</author><pubDate>Sat, 14 Sep 2019 17:24:36 +0800</pubDate><description><![CDATA[牛客小白月赛17-G区间求和(莫队)
题目链接：https://ac.nowcoder.com/acm/contest/1085/G
题意：
给你n个数，每个数为$a_i$​，现在有m个询问，每个询问l,r，需要求出：  
∑i=lrai∗num(a[i])\sum_{i=l}^{r}a_i*num(a[i])i=l∑r​ai​∗num(a[i])
num(a[i])num(a[i])num(a[...]]></description><category></category></item><item><title><![CDATA[codeforces-1213G-Path Queries(并查集+离线)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100771135</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100771135</guid><author>CCchengzi</author><pubDate>Thu, 12 Sep 2019 14:29:54 +0800</pubDate><description><![CDATA[#codeforces-1213G-Path Queries(并查集+离线)
###题目链接：http://codeforces.com/problemset/problem/1213/G
##题意：
首先给出两个数n,m(1&lt;=n,m&lt;=2e5),表示树的点数和询问树，接着n-1行，每行三个数u,v,w
表示树上u到v节点有一条权值为w的边，接下来一行m个询问，每个询问要求输出树上两...]]></description><category></category></item><item><title><![CDATA[poj1330 Nearest Common Ancestors P(LCA)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100764342</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100764342</guid><author>CCchengzi</author><pubDate>Thu, 12 Sep 2019 10:35:42 +0800</pubDate><description><![CDATA[#poj1330 Nearest Common Ancestors P(LCA)
###传送门：http://poj.org/problem?id=1330
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;vector&gt;
using namespace std;
const...]]></description><category></category></item><item><title><![CDATA[#codeforces 1213D2(Equalizing by Division)(思维好题)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100751342</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100751342</guid><author>CCchengzi</author><pubDate>Wed, 11 Sep 2019 22:23:20 +0800</pubDate><description><![CDATA[#codeforces 1213D2(Equalizing by Division)(思维好题)
###题意：
首先给出两个数n,k(1&lt;=k&lt;=n&lt;=2e5),接着一行输入n个数，第i个数为aia_iai​,范围为(1,2e5),每次操作可以把aia_iai​变为ai2\frac{a_i}{2}2ai​​
求使得n个数中有k个相同的数的最少操作次数
###分析：
因为给出的数范...]]></description><category></category></item><item><title><![CDATA[bzoj3930选数(mobius+预处理)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100710710</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100710710</guid><author>CCchengzi</author><pubDate>Tue, 10 Sep 2019 20:06:52 +0800</pubDate><description><![CDATA[bzoj3930选数(mobius+预处理)
题意：输入四个数N，K，L，H， 1≤N,K≤10^9，1≤L≤H≤10^9，H-L≤10^5，求从L到H中选出n个数，且这n个数的最大公约数为k的方法数
ans=∑i1=lh∑i2=lh......∑in=lhgcd(i1,i2......in)=k
ans=\sum_{i_1=l}^{h}\sum_{i_2=l}^{h}......\sum_{i_...]]></description><category></category></item><item><title><![CDATA[CF1217D Coloring Edges(思维+拓扑排序)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/100691308</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/100691308</guid><author>CCchengzi</author><pubDate>Tue, 10 Sep 2019 10:29:09 +0800</pubDate><description><![CDATA[##CF1217D Coloring Edges(思维+拓扑排序)###
###题目链接：http://codeforces.com/problemset/problem/1217/D
###题意：
第一行给出n和m（2≤n≤5000,1≤m≤5000),代表无向图的点数和边数接下来m行，每行两个数u,v,表示一条u到v的有向边
没有自环和重边问用最少的颜色给图染色，使得任意一个环中的边没有相同的...]]></description><category></category></item><item><title><![CDATA[次短路]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/93730808</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/93730808</guid><author>CCchengzi</author><pubDate>Wed, 26 Jun 2019 22:35:06 +0800</pubDate><description><![CDATA[poj3255 次短路
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;queue&gt;
using namespace std;
const int N = 1e5 + 10;

int n,m;
int dis1[N],dis2[N];

struct node{
    ...]]></description><category></category></item><item><title><![CDATA[POJ 1236-Network of Schools(tarjan缩点)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/90238505</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/90238505</guid><author>CCchengzi</author><pubDate>Wed, 15 May 2019 16:02:32 +0800</pubDate><description><![CDATA[POJ 1236-Network of Schools(tarjan缩点)

传送门qwq：http://poj.org/problem?id=1236
题目大意：
有n(2&lt;=n&lt;=100)个学校，学校之间有单向网络，一个学校在得到软件之后可以顺着单向网络向其他学校传输
输入给出每个学校可以向其他学校传输的传输列表
1.初始时至少几个学校得到该软件才能使得网络内所有学校都收到该软件
...]]></description><category></category></item><item><title><![CDATA[HDU 4279-Number(欧拉函数和约数个数的性质)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/89221120</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/89221120</guid><author>CCchengzi</author><pubDate>Thu, 11 Apr 2019 21:58:05 +0800</pubDate><description><![CDATA[HDU 4279-Number(欧拉函数和约数个数的性质)

http://acm.hdu.edu.cn/showproblem.php?pid=4279
题目大意：
定义f(n)为大于1小于n且不是n的约数的数的个数，若f(n)为奇数，则n是一个real number
计算在给定的区间内real number的个数
思路：
首先我们要知道


若n &gt; 2，n的欧拉函数值肯定是偶数


若...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #548 (Div2)]]></title><link>https://blog.youkuaiyun.com/CCchengzi/article/details/89176172</link><guid>https://blog.youkuaiyun.com/CCchengzi/article/details/89176172</guid><author>CCchengzi</author><pubDate>Wed, 10 Apr 2019 10:37:37 +0800</pubDate><description><![CDATA[Codeforces Round #548 (Div. 2)

http://codeforces.com/contest/1139
A. Even Substrings
题目大意：大概就是让你找到所有的偶数，然后让你累加这个偶数及之前的所有数的个数
#include&lt;bits/stdc++.h&gt;
using namespace std;
const int MAXN = 65009;...]]></description><category></category></item></channel></rss>