<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Java_beginer1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Java_beginer1]]></copyright><item><title><![CDATA[归并排序C++实现]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/14215829</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/14215829</guid><author>Java_beginer1</author><pubDate>Tue, 05 Nov 2013 23:36:56 +0800</pubDate><description><![CDATA[归并排序]]></description><category></category></item><item><title><![CDATA[堆排序]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/11752699</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/11752699</guid><author>Java_beginer1</author><pubDate>Tue, 17 Sep 2013 01:37:20 +0800</pubDate><description><![CDATA[堆排序]]></description><category></category></item><item><title><![CDATA[c++虚函数]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/10197199</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/10197199</guid><author>Java_beginer1</author><pubDate>Thu, 22 Aug 2013 19:24:54 +0800</pubDate><description><![CDATA[vtable]]></description><category></category></item><item><title><![CDATA[C++纯虚函数可以在类外实现]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/10196723</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/10196723</guid><author>Java_beginer1</author><pubDate>Thu, 22 Aug 2013 19:01:30 +0800</pubDate><description><![CDATA[纯虚函数 类外实现]]></description><category></category></item><item><title><![CDATA[C++虚函数]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/10196001</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/10196001</guid><author>Java_beginer1</author><pubDate>Thu, 22 Aug 2013 18:37:30 +0800</pubDate><description><![CDATA[C++纯虚函数&&抽象类]]></description><category></category></item><item><title><![CDATA[kmp&&hdu 1711 next数组]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/10141847</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/10141847</guid><author>Java_beginer1</author><pubDate>Wed, 21 Aug 2013 13:47:29 +0800</pubDate><description><![CDATA[KMP]]></description><category></category></item><item><title><![CDATA[unix 网路编程（卷一）第一个程序编译过程]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/9732815</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/9732815</guid><author>Java_beginer1</author><pubDate>Sat, 03 Aug 2013 16:01:46 +0800</pubDate><description><![CDATA[unix网络编程]]></description><category></category></item><item><title><![CDATA[乱侃c++]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/9618989</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/9618989</guid><author>Java_beginer1</author><pubDate>Mon, 29 Jul 2013 17:58:19 +0800</pubDate><description><![CDATA[就在刚才我感觉c++真的好复杂，函数重载，多态，虚函数，虚函数表，模版，继承等一大坨东西好恶心，c++既然完全支持C语言，当然是把它的优缺点统统接下了，C语言中指针本身并不太难，是C语言的精华，当年刚开始学习C时看到说，学不会指针C和没学一样，当时真是熬夜看我们系老师自己编的那本白皮书，看指针看的眼花，东西学的再多，长时间不用很快又会忘得，就像是记英语单词一回事，学了不用东西永远不是自己的。
指]]></description><category></category></item><item><title><![CDATA[C++&&Mysql&&codeblocks]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/9152563</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/9152563</guid><author>Java_beginer1</author><pubDate>Sat, 22 Jun 2013 21:19:54 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 

using namespace std;

/*数据库连接用宏*/
#define HOST "localhost"
#define USERNAME "root"
#define PASSWORD "333333"
#define DATABASE "test"

void query_sql(char* sql)]]></description><category></category></item><item><title><![CDATA[各种字符串hash]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8908840</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8908840</guid><author>Java_beginer1</author><pubDate>Fri, 10 May 2013 07:56:11 +0800</pubDate><description><![CDATA[unsigned int SDBMHash(char *str){
 	unsigned int hash = 0; 
 	while (*str) { 
 	// equivalent to:
 	 	hash = 65599*hash + (*str++);
 	 	 hash = (*str++) + (hash << 6) + (hash << 16) - hash; 
 	  }]]></description><category></category></item><item><title><![CDATA[cf 160 div2 A python搞的水题一枚]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8521757</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8521757</guid><author>Java_beginer1</author><pubDate>Sun, 20 Jan 2013 11:32:16 +0800</pubDate><description><![CDATA[import sys
#from bs4 import BeautifulSoup
def countLuckyDigit(x):
    cnt=0
    while x>0:
        d=x%10
        x=x//10
        if d==4 or d==7:
            cnt=cnt+1
    return cnt
n,k=map(int,raw_]]></description><category></category></item><item><title><![CDATA[poj 3264  区间最值]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8160962</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8160962</guid><author>Java_beginer1</author><pubDate>Thu, 08 Nov 2012 10:22:19 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1 | 1
const int N=51002;
int Max[N<<2],Min[N<<2],mmax,mmin;
void PushUp(int]]></description><category></category></item><item><title><![CDATA[poj hotel线段树区间合并]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8154619</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8154619</guid><author>Java_beginer1</author><pubDate>Tue, 06 Nov 2012 19:35:47 +0800</pubDate><description><![CDATA[节点主要记录三个信息：msum,lsum,rsum；
假设，L---R代表当前节点代表区间；
msum表示 在L————R区间内最大连续空房间数目;
lsum表示在L————R区间内以L为起点的最大连续空房间数目；
rsum表示在L————R区间内以R为右端点(自由向左的)的最大连续空房间数目；
#include
#include
#include
#include
#include
#]]></description><category></category></item><item><title><![CDATA[给出一个n个元素的链表输出倒数第k个节点]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8116795</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8116795</guid><author>Java_beginer1</author><pubDate>Fri, 26 Oct 2012 19:57:42 +0800</pubDate><description><![CDATA[用两个指针；初始化为头指针；用其中一个指针遍历链表，当该指针遍历到第k个节点时，另外一个指针开始从头节点开始遍历链表；两个指针之间的距离为k;遍历完链表时第二个指针所指向的节点就是倒数第K个：
#include
#include
#include
using namespace std;
struct node{
    int val;
    node *next;
    node(){]]></description><category></category></item><item><title><![CDATA[HDU3234]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8041531</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8041531</guid><author>Java_beginer1</author><pubDate>Fri, 05 Oct 2012 18:16:24 +0800</pubDate><description><![CDATA[尼玛这题出题人太JB NB了，乍一看以为线段树，仔细看看发现不是，查询时区间不连续
后来就搜索解题报告，才知道是并查集 ，但是又不知道咋个并，咋个查。。。ORZ，，，，蒟蒻，
题意：给出一个数值固定的数列，x0,x1,x2,……xn-1;


#include
#include
#include
#include
#include
#include
using namespace std]]></description><category></category></item><item><title><![CDATA[http://poj.org/problem?id=1657&&Distance on Chessboard]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8037188</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8037188</guid><author>Java_beginer1</author><pubDate>Tue, 02 Oct 2012 20:59:33 +0800</pubDate><description><![CDATA[象：在同一斜线上，一步可以到达，不在同一斜线上，如果两点颜色相同两步可达，否则不可达;
#include
#include
#include
#include
#include
#include
#include
#include
#include
 
#include
using namespace std;
const int N=100015;
bool map[9][9];
int ma]]></description><category></category></item><item><title><![CDATA[POJ 1986 LCA模板加强点的]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8036511</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8036511</guid><author>Java_beginer1</author><pubDate>Tue, 02 Oct 2012 13:04:01 +0800</pubDate><description><![CDATA[题意算是见过的最龌龊的了，你妹的，都不知道一共有多少个顶点，RE几次后立马把数组开到10W级别的；
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int N=100015;
 struct node
 {]]></description><category></category></item><item><title><![CDATA[POJ1470&&最近公共祖先]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8035505</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8035505</guid><author>Java_beginer1</author><pubDate>Mon, 01 Oct 2012 17:48:46 +0800</pubDate><description><![CDATA[输入淡腾要死：纯粹模板
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int N=1005;
int father[N];
vectorM[N],Q[N];
bool vis[N];
int n,in[N],a]]></description><category></category></item><item><title><![CDATA[POJ1330&&LCA最近公共祖先模板]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8034329</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8034329</guid><author>Java_beginer1</author><pubDate>Sun, 30 Sep 2012 17:59:31 +0800</pubDate><description><![CDATA[在这我用的是tarjan搞的：tarjan的话需要知道树的根节点，这题没说，但是可以根据入度等于0，判断根节点;tarjan的主要思想是DFS和并查集;
tarjan:有待补充
	#include
	#include
	#include
	#include
	#include
	#include
	#include
	#include
	#include
	#include
	using na]]></description><category></category></item><item><title><![CDATA[月老的难题&&二分图最大匹配模板&&http://acm.nyist.net/JudgeOnline/problem.php?pid=239]]></title><link>https://blog.youkuaiyun.com/Java_beginer1/article/details/8033291</link><guid>https://blog.youkuaiyun.com/Java_beginer1/article/details/8033291</guid><author>Java_beginer1</author><pubDate>Sat, 29 Sep 2012 21:09:25 +0800</pubDate><description><![CDATA[二分图最大匹配：用邻接矩阵超时，需要用邻接表;
#include
#include
#include
#include
#include
#include
using namespace std;
const int N=512;
bool chk[N];
vectorvis[N];
int n;
int xM[N],yM[N];
bool SearchPath(int u)
{
	int dd]]></description><category></category></item></channel></rss>