<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[creatorx的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/creatorx</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; creatorx]]></copyright><item><title><![CDATA[数据结构-树堆（Treap）]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/80248329</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/80248329</guid><author>creatorx</author><pubDate>Wed, 09 May 2018 09:00:01 +0800</pubDate><description><![CDATA[现在给你一个问题，每次右两种操作，第一种操作是向集合中添加一个数x,第二种操作是询问集合中不大于k的最大的数是多少。现在我们不用任何stl里面的容器的情况下，你要怎样解决这个问题呢？一个最暴力的方法是，从一个数组存数，然后每次询问去遍历这个数组，这样每次插入数的时间复杂度是O(1),而查询时间复杂是O(n)，所以这种方法对于查询操作比较多时，会很慢.有基础的同学可能会想到用二分去找，但是用二分必须...]]></description><category></category></item><item><title><![CDATA[数据结构-Heap(堆)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/80215543</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/80215543</guid><author>creatorx</author><pubDate>Sun, 06 May 2018 17:43:26 +0800</pubDate><description><![CDATA[好久没有写博客了，感觉学的东西都快忘完了。这几天准备学下平衡树的知识，不过在学习那之前还是先学习一下更为基础的一种数据结构Heap，我们称为堆。先说下什么叫做堆，堆有小根堆和大堆根，首先堆的本质是一棵完全二叉树。跟二叉搜索树的区别在于，二叉搜索树的特点是左子树上的所有节点的值都小于根节点的值，右子树上的所有节点的值都大于根节点的值。然后对于每棵子树，都是一棵二叉搜索树。根据二叉搜索树的定义我们容易...]]></description><category></category></item><item><title><![CDATA[2017ICPC沈阳现场赛G(倍增思想)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78478663</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78478663</guid><author>creatorx</author><pubDate>Wed, 08 Nov 2017 14:51:21 +0800</pubDate><description><![CDATA[Infinite Fraction Path
Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 279    Accepted Submission(s): 34



Problem Description

The ]]></description><category></category></item><item><title><![CDATA[SPOJ COT2(树上莫队)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78458832</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78458832</guid><author>creatorx</author><pubDate>Mon, 06 Nov 2017 16:22:27 +0800</pubDate><description><![CDATA[You are given a tree with N nodes.The tree nodes are numbered from 1 to N.Each node has an integer weight.

We will ask you to perfrom the following operation:

u v : ask for how many different in]]></description><category></category></item><item><title><![CDATA[2017CCPC秦皇岛H(二分 + 二分图的最大匹配数)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78414147</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78414147</guid><author>creatorx</author><pubDate>Wed, 01 Nov 2017 15:07:38 +0800</pubDate><description><![CDATA[Prime Set

Time Limit: 2 Seconds      Memory Limit: 131072 KB

Given an array of  integers ,
 we say a set  is
 a prime set of the given array, if  and  is
 prime.
BaoBao has just found an arr]]></description><category></category></item><item><title><![CDATA[kattis Grid MST (最小曼哈顿生成树)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78331893</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78331893</guid><author>creatorx</author><pubDate>Tue, 24 Oct 2017 17:13:48 +0800</pubDate><description><![CDATA[Grid MST



This is a very simple problem. You are given NN points.
 Some points may be repeated. The weight (distance) between two points is given by the Manhattan distance between the two point]]></description><category></category></item><item><title><![CDATA[UVA6642(树的点分治)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78323189</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78323189</guid><author>creatorx</author><pubDate>Mon, 23 Oct 2017 20:52:06 +0800</pubDate><description><![CDATA[题意：给你一颗树，树上的每个顶点有一个权值，给定一个数k,让你找一条路径，使得这条路径上的点的权值的乘积模上一个数后等于k.


解题思路：这是一道树分治的经典题目，也是我做的第一道树分治的题目，这题的话比较简单，几乎模板，需要注意的地方是逆元要一次求出，还要注意一下hash的地方，写的太丑会t.


#include 
using namespace std;
typedef lon]]></description><category></category></item><item><title><![CDATA[HDU2476(区间dp)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78264742</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78264742</guid><author>creatorx</author><pubDate>Tue, 17 Oct 2017 18:50:37 +0800</pubDate><description><![CDATA[String painter
Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4905    Accepted Submission(s): 2316



Problem Description

There are t]]></description><category></category></item><item><title><![CDATA[Nordic Collegiate Programming Contest 2017 题解]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78206732</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78206732</guid><author>creatorx</author><pubDate>Wed, 11 Oct 2017 18:18:37 +0800</pubDate><description><![CDATA[前几天打了一场外国人的比赛，感觉那边的题目质量还是很好的，区分度很鲜明，题目没有国内的难，坑点比较少，比较注重思维，基础算法。


B题：




Best Relay Team





Picture by Fernando
 Frazão/Agência Brasil, cc by

You are the coach of the national ath]]></description><category></category></item><item><title><![CDATA[POJ1195(树状数组)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78194349</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78194349</guid><author>creatorx</author><pubDate>Tue, 10 Oct 2017 16:40:33 +0800</pubDate><description><![CDATA[Mobile phones




Time Limit: 5000MS
 
Memory Limit: 65536K


Total Submissions: 20799
 
Accepted: 9619




Description

Suppose that the fourth generation mobile phone base station]]></description><category></category></item><item><title><![CDATA[POJ2195(最小费用最大流)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78155414</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78155414</guid><author>creatorx</author><pubDate>Tue, 03 Oct 2017 17:12:17 +0800</pubDate><description><![CDATA[Going Home




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 23761
 
Accepted: 11948




Description

On a grid map there are n little men and n houses. In each uni]]></description><category></category></item><item><title><![CDATA[二项式反演]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78155385</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78155385</guid><author>creatorx</author><pubDate>Tue, 03 Oct 2017 17:05:29 +0800</pubDate><description><![CDATA[今天俊成问了我一个有意思的组合数学问题：给你n的格子（排成一行），给你k种颜色，问你有多少种方法，使得没有两个相连的格子颜色相连，且每种颜色都要用到的方案数。数学弱渣表示想了很久没有头绪，看了题解，发现都是用容斥做的，容斥？不是我最喜欢的吗？为什么我一点都没有想到，结果这个容斥跟我们平时的有点不一样，最后发现有个二项式反演的东西，很有用，网上简单学了一下，先把公式放这里，有时间用这个公式做下题：]]></description><category></category></item><item><title><![CDATA[POJ3281(最大流)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78147459</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78147459</guid><author>creatorx</author><pubDate>Sun, 01 Oct 2017 14:50:31 +0800</pubDate><description><![CDATA[Dining




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 19600
 
Accepted: 8716




Description

Cows are such finicky eaters. Each cow has a preference for certain]]></description><category></category></item><item><title><![CDATA[POJ3436(最大流)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78142106</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78142106</guid><author>creatorx</author><pubDate>Sat, 30 Sep 2017 13:56:23 +0800</pubDate><description><![CDATA[ACM Computer Factory




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 8309
 
Accepted: 3017
 
Special Judge




Description

As you know, all the computers used]]></description><category></category></item><item><title><![CDATA[864F(tarjan思想)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78137359</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78137359</guid><author>creatorx</author><pubDate>Fri, 29 Sep 2017 21:03:25 +0800</pubDate><description><![CDATA[F. Cities Excursions


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



There are n cities in Berland. Some pa]]></description><category></category></item><item><title><![CDATA[UESTC1722(二分)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78126993</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78126993</guid><author>creatorx</author><pubDate>Thu, 28 Sep 2017 18:39:14 +0800</pubDate><description><![CDATA[越快越好！




Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)



Submit 
Status


假期将至，潘警长打算带n个实习步行出去巡逻，他们正通过一条长l米的通道。每个见习的速度恒定为v1米每秒。
为了尽快通过这条通道，大家向总部请求了]]></description><category></category></item><item><title><![CDATA[864E(dp + 线段树优化)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78114717</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78114717</guid><author>creatorx</author><pubDate>Wed, 27 Sep 2017 16:54:30 +0800</pubDate><description><![CDATA[E. Fire


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Polycarp is in really serious trouble — his house i]]></description><category></category></item><item><title><![CDATA[UESTC1712(Nim博弈)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78111519</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78111519</guid><author>creatorx</author><pubDate>Wed, 27 Sep 2017 12:24:39 +0800</pubDate><description><![CDATA[七夜雪寂，一世人心




Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)



Submit 
Status

Nim游戏是一种传统的游戏，其套路也渐渐被人熟悉，大家都不喜欢这种一眼就看出输赢的游戏，因此有人修改了Nim游戏的规则：
1.这仍然是一个二]]></description><category></category></item><item><title><![CDATA[UESTC1713(求两个圆的面积的交)]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78106973</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78106973</guid><author>creatorx</author><pubDate>Tue, 26 Sep 2017 21:10:57 +0800</pubDate><description><![CDATA[无关青云路，无关诗书，无你处，无江湖




Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)



Submit 
Status

每个圆的属性可以使用三个参数来描述，xx-圆心横坐标，yy-圆心纵坐标，rr-半径，现给出两个圆分别的参数，求两个圆相交的面]]></description><category></category></item><item><title><![CDATA[2017icpc北京网络赛c题（最大连续子段和）]]></title><link>https://blog.youkuaiyun.com/creatorx/article/details/78105129</link><guid>https://blog.youkuaiyun.com/creatorx/article/details/78105129</guid><author>creatorx</author><pubDate>Tue, 26 Sep 2017 17:58:41 +0800</pubDate><description><![CDATA[时间限制:1000ms
单点时限:1000ms
内存限制:256MB





描述
Once upon a time, there was a little dog YK. One day, he went to an antique shop and was impressed by a beautiful picture. YK loved it very much.
H]]></description><category></category></item></channel></rss>