<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[天使之剑？]]></title><description><![CDATA[剑指AC~~~]]></description><link>https://blog.youkuaiyun.com/jiangX1994</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jiangX1994]]></copyright><item><title><![CDATA[位移位运算符]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38795427</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38795427</guid><author>jiangX1994</author><pubDate>Sun, 24 Aug 2014 12:50:48 +0800</pubDate><description><![CDATA[位移位运算符
        位移位运算符是将数据看成二进制数，对其进行向左或向右移动若干位的运算。位移位运算符分为左移和右移两种，均为双目运算符。第一运算对象是移位对象，第二个运算对象是所移的二进制位数。
　　移位时，移出的位数全部丢弃，移出的空位补入的数与左移还是右移花接木有关。如果是左移，则规定补入的数全部是0；如果是右移，还与被移位的数据是否带符号有关。若是不带符号数，则补入的数全部为]]></description><category></category></item><item><title><![CDATA[数组名做函数参数]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38753087</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38753087</guid><author>jiangX1994</author><pubDate>Fri, 22 Aug 2014 11:23:50 +0800</pubDate><description><![CDATA[数组名做函数参数
用数组名做函数参数与用数组元素作实参有几点不同：
（1）用数组元素作实参时，只要数组类型和函数的形参变量的类型一致，那么作为下标变量的数组元素的类型也和函数形参变量的类型是一致的。因此，并不要求函数的形参也是下标变量。换句话说，对数组元素的处理是按普通变量对待的。用数组名作函数参数时，则要求形参和相应的实参都必须是类型相同的数组，都必须有明确的数组说明。当形参和实参两者类型不]]></description><category></category></item><item><title><![CDATA[二叉树的遍历]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38751081</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38751081</guid><author>jiangX1994</author><pubDate>Fri, 22 Aug 2014 09:39:28 +0800</pubDate><description><![CDATA[二叉树的遍历


二叉树的遍历有三种方式，如下：

（1）前序遍历（DLR），首先访问根结点，然后遍历左子树，最后遍历右子树。简记根-左-右。

（2）中序遍历（LDR），首先遍历左子树，然后访问根结点，最后遍历右子树。简记左-根-右。

（3）后序遍历（LRD），首先遍历左子树，然后遍历右子树，最后访问根结点。简记左-右-根。 

  

例1：如上图所示的二叉树，若按]]></description><category></category></item><item><title><![CDATA[算法的时间复杂度和空间复杂度]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38750743</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38750743</guid><author>jiangX1994</author><pubDate>Fri, 22 Aug 2014 09:28:40 +0800</pubDate><description><![CDATA[算法的时间复杂度和空间复杂度

常用的算法的时间复杂度和空间复杂度





排序法


最差时间分析

平均时间复杂度

稳定度

空间复杂度



冒泡排序

O(n2)

O(n2)

稳定

O(1)



快速排序

O(n2)

O(n*log2n)

不稳定

O(log2n)~O(n)



]]></description><category></category></item><item><title><![CDATA[Codeforces Round #261(Div.2) A. Pashmak and Garden]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38702379</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38702379</guid><author>jiangX1994</author><pubDate>Wed, 20 Aug 2014 10:11:51 +0800</pubDate><description><![CDATA[A. Pashmak and Garden


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Pashmak has fallen in love with an att]]></description><category></category></item><item><title><![CDATA[hdu3270 The Diophantine Equation]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38470253</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38470253</guid><author>jiangX1994</author><pubDate>Sun, 10 Aug 2014 15:20:11 +0800</pubDate><description><![CDATA[The Diophantine Equation

Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1116    Accepted Submission(s): 287



Problem Description
W]]></description><category></category></item><item><title><![CDATA[hdu 2795-Billboard]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38454157</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38454157</guid><author>jiangX1994</author><pubDate>Sat, 09 Aug 2014 10:20:52 +0800</pubDate><description><![CDATA[Billboard

Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 10674    Accepted Submission(s): 4727



Problem Description
At the entra]]></description><category></category></item><item><title><![CDATA[hdu4027-Can you answer these queries?(线段树)]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38441531</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38441531</guid><author>jiangX1994</author><pubDate>Fri, 08 Aug 2014 16:47:59 +0800</pubDate><description><![CDATA[Can you answer these queries?

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)

Total Submission(s): 8330    Accepted Submission(s): 1904



Problem Descrip]]></description><category></category></item><item><title><![CDATA[hdu 1542 Atlantis(线段树)]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38436435</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38436435</guid><author>jiangX1994</author><pubDate>Fri, 08 Aug 2014 11:08:08 +0800</pubDate><description><![CDATA[Atlantis

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 6899    Accepted Submission(s): 3022



Problem Description
There are sever]]></description><category></category></item><item><title><![CDATA[hdu 1754 I Hate It]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38425709</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38425709</guid><author>jiangX1994</author><pubDate>Thu, 07 Aug 2014 21:43:09 +0800</pubDate><description><![CDATA[I Hate It

Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 37914    Accepted Submission(s): 15000



Problem Description
很多学校流行一种比较的习]]></description><category></category></item><item><title><![CDATA[线段树模板]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38421323</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38421323</guid><author>jiangX1994</author><pubDate>Thu, 07 Aug 2014 16:46:44 +0800</pubDate><description><![CDATA[//线段树模板
struct line
{
int left,right;//左端点、右端点
int n;//记录这条线段出现了多少次，默认为0
};
struct line a[100];
int sum;
//建立
void build(int s,int t,int n)
{
int mid=(s+t)/2;
a[n].left=s;
a[n].right=t;]]></description><category></category></item><item><title><![CDATA[poj 1195--Mobile phones]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38406427</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38406427</guid><author>jiangX1994</author><pubDate>Wed, 06 Aug 2014 20:45:52 +0800</pubDate><description><![CDATA[Mobile phones




Time Limit: 5000MS
 
Memory Limit: 65536K


Total Submissions: 14673
 
Accepted: 6825




Description

Suppose that the fourth generation mobile phone base station]]></description><category></category></item><item><title><![CDATA[poj 3321 Apple Tree]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38402719</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38402719</guid><author>jiangX1994</author><pubDate>Wed, 06 Aug 2014 16:08:22 +0800</pubDate><description><![CDATA[Apple Tree




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 18831
 
Accepted: 5711




Description

There is an apple tree outside of kaka's house. Every autumn, a]]></description><category></category></item><item><title><![CDATA[内置函数--inline]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38402223</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38402223</guid><author>jiangX1994</author><pubDate>Wed, 06 Aug 2014 15:45:42 +0800</pubDate><description><![CDATA[（一）inline函数（摘自C++ Primer的第三版）

在函数声明或定义中函数返回类型前加上关键字inline即把min（）指定为内联（内置函数）。

      inline int min(int first, int secend) {/****/};

      inline 函数对编译器而言必须是可见的，以便它能够在调用点内展开该函数。与非inline函数不同的是，i]]></description><category></category></item><item><title><![CDATA[hdu1166敌兵布阵（线段树）]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38390265</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38390265</guid><author>jiangX1994</author><pubDate>Tue, 05 Aug 2014 20:28:25 +0800</pubDate><description><![CDATA[线段树(interval tree) 是把区间逐次二分得到的一树状结构，它反映了包括归并排序在内的很多分治算法的问题求解方式。

 
上图是一棵典型的线段树，它对区间[1,10]进行分割，直到单个点。这棵树的特点是：
1. 每一层都是区间[a, b]的一个划分，记 L = b - a
2. 一共有log2L层
3. 给定一个点p，从根到叶子p上的所有区间都包含点p，且其他区间都不包含点]]></description><category></category></item><item><title><![CDATA[树状数组（数据结构）]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38386599</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38386599</guid><author>jiangX1994</author><pubDate>Tue, 05 Aug 2014 15:49:23 +0800</pubDate><description><![CDATA[1 一维树状数组


  1 什么是树状数组
       树状数组是一个查询和修改复杂度都为log(n)的数据结构，假设数组A[1..n]，那么查询A[1]+...+A[n]的时，间是log级别的，而且是一个在线的数据结构。

  2 树状数组作用
       我们经常会遇到动态连续和查询问题，给定n个元素A[1~N]，让我们求sum[L,R] = A[L]+...+A[R]，或]]></description><category></category></item><item><title><![CDATA[hdu-1973 Prime Path]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38373027</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38373027</guid><author>jiangX1994</author><pubDate>Mon, 04 Aug 2014 17:50:34 +0800</pubDate><description><![CDATA[Prime Path

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 371    Accepted Submission(s): 236




Problem Description
The ministers]]></description><category></category></item><item><title><![CDATA[hdu 1052]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38319073</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38319073</guid><author>jiangX1994</author><pubDate>Thu, 31 Jul 2014 16:11:43 +0800</pubDate><description><![CDATA[Tian Ji -- The Horse Racing

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 11410    Accepted Submission(s): 3196



Problem Descript]]></description><category></category></item><item><title><![CDATA[hdu 1171 Big Event in HDU]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38306603</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38306603</guid><author>jiangX1994</author><pubDate>Wed, 30 Jul 2014 20:45:47 +0800</pubDate><description><![CDATA[Big Event in HDU

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 23007    Accepted Submission(s): 8089


Problem Description
Nowaday]]></description><category></category></item><item><title><![CDATA[大一总结]]></title><link>https://blog.youkuaiyun.com/jiangX1994/article/details/38276535</link><guid>https://blog.youkuaiyun.com/jiangX1994/article/details/38276535</guid><author>jiangX1994</author><pubDate>Tue, 29 Jul 2014 19:38:52 +0800</pubDate><description><![CDATA[心中想写这篇东东的冲动早已积蓄多事，在]]></description><category></category></item></channel></rss>