<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[原点]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ky961221</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ky961221]]></copyright><item><title><![CDATA[redis底层数据结构]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/100866069</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/100866069</guid><author>ky961221</author><pubDate>Thu, 19 Sep 2019 20:34:25 +0800</pubDate><description><![CDATA[redis对外公开的有5种数据结构，分别是String，List，Hash，Set，ZSet。这几种底层分别用了不同的数据结构来实现。

redis介绍：

redis是一个开源的使用C语言编写的一个kv存储系统，是一个速度非常快的非关系内存数据库。它支持包括String、List、Set、Zset、hash五种数据结构。
与关系型数据库相比，redis的命令请求不需要经过查询分析器或查询优化器进...]]></description><category></category></item><item><title><![CDATA[3000道POJ英文题中高频词汇--HADOOP单词统计]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/78597915</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/78597915</guid><author>ky961221</author><pubDate>Tue, 21 Nov 2017 22:54:58 +0800</pubDate><description><![CDATA[最近学习HADOOP，写mapreduce，最简单的单词统计。
以前刷题，英语不好，很烦。
现在统计一下poj上单词。
首先，抓取了1000--4000的英文题目，对数据进行清洗，把不需要的数字，中文，各种奇怪的符号都去掉。
然后直接跑mapreduce
统计出这3000道题才有不到800个不同的单词，先看一下结果。


统计结果还是可以被参考的。


统计
package]]></description><category></category></item><item><title><![CDATA[Hadoop-mapreduce org.apache.hadoop.io.LongWritable cannot be cast to org.apache.hadoop.io.Text错误]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/76571378</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/76571378</guid><author>ky961221</author><pubDate>Wed, 02 Aug 2017 09:57:34 +0800</pubDate><description><![CDATA[java.lang.Exception: java.lang.ClassCastException: org.apache.hadoop.io.LongWritable cannot be cast to org.apache.hadoop.io.Text

（Hadoop的输入LongWritable不能转变为Text）

When you read a file with a M/R]]></description><category></category></item><item><title><![CDATA[餐厅管理系统]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/54565059</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/54565059</guid><author>ky961221</author><pubDate>Sun, 15 Jan 2017 22:07:31 +0800</pubDate><description><![CDATA[ACM结束了

10天实训 3000行代码  

 


#include &amp;lt;graphics.h&amp;gt;
#include &amp;lt;conio.h&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;string&amp;gt;
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;windo...]]></description><category></category></item><item><title><![CDATA[POJ Kaka's Matrix Travels 3422 (最小费用最大流)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53439376</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53439376</guid><author>ky961221</author><pubDate>Fri, 02 Dec 2016 21:34:44 +0800</pubDate><description><![CDATA[Kaka's Matrix Travels




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 9524
 
Accepted: 3876





Description

On an N × N chessboard with a non-negative number i]]></description><category></category></item><item><title><![CDATA[POJ Going Home (2195)(最小费用最大流)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53412976</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53412976</guid><author>ky961221</author><pubDate>Wed, 30 Nov 2016 20:15:29 +0800</pubDate><description><![CDATA[Going Home




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 22076
 
Accepted: 11148





Description

On a grid map there are n little men and n houses. In each u]]></description><category></category></item><item><title><![CDATA[POJ Power Network 1459（最大流）]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53399538</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53399538</guid><author>ky961221</author><pubDate>Tue, 29 Nov 2016 20:35:29 +0800</pubDate><description><![CDATA[Power Network




Time Limit: 2000MS
 
Memory Limit: 32768K


Total Submissions: 27572
 
Accepted: 14333





Description

A power network consists of nodes (power stations, consum]]></description><category></category></item><item><title><![CDATA[POJ Find them, Catch them 1703 (关系型并查集)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53384638</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53384638</guid><author>ky961221</author><pubDate>Mon, 28 Nov 2016 21:03:08 +0800</pubDate><description><![CDATA[Find them, Catch them




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 42711
 
Accepted: 13146




Description

The police office in Tadu City decides to say ends ]]></description><category></category></item><item><title><![CDATA[POJ 1182 食物链 （关系型并查集）]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53383349</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53383349</guid><author>ky961221</author><pubDate>Mon, 28 Nov 2016 20:26:09 +0800</pubDate><description><![CDATA[题意就不说了
在网上看了好多题解，好多都是用再加一个关系数组，可惜本弱鸡没看懂，找到了一种自己认为还挺好理解的方法。

这种方法是：建一个3*N的并查集
                      1--N               表示同类    比如 pre[ 3 ]=4 ,表示3和4是同类
                      N+1--N*2       表示这个吃谁   比如 pre[ 2 ] = 1 ,表示2吃1
                      N*2+1 --N*3   表]]></description><category></category></item><item><title><![CDATA[POj King 1364(差分约束)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53312106</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53312106</guid><author>ky961221</author><pubDate>Wed, 23 Nov 2016 21:23:12 +0800</pubDate><description><![CDATA[King




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 12687
 
Accepted: 4598





Description

Once, in one kingdom, there was a queen and that queen was expectin]]></description><category></category></item><item><title><![CDATA[POJ 3159 Candies(差分约束)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53264389</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53264389</guid><author>ky961221</author><pubDate>Mon, 21 Nov 2016 21:10:16 +0800</pubDate><description><![CDATA[Candies




Time Limit: 1500MS
 
Memory Limit: 131072K


Total Submissions: 29958
 
Accepted: 8305





Description


During the kindergarten days, flymouse was the monitor of his]]></description><category></category></item><item><title><![CDATA[POJ Intervals (1201)(差分约束)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53202360</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53202360</guid><author>ky961221</author><pubDate>Thu, 17 Nov 2016 16:53:16 +0800</pubDate><description><![CDATA[Intervals




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 25777
 
Accepted: 9868





Description

You are given n closed, integer intervals [ai, bi] and n integ]]></description><category></category></item><item><title><![CDATA[POJ Y2K Accounting Bug 2586(贪心)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53141307</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53141307</guid><author>ky961221</author><pubDate>Sat, 12 Nov 2016 16:10:58 +0800</pubDate><description><![CDATA[//2586
//连续5个月必须是亏的，找出这5个月中至少亏几个月
//ct==1 ssssd ssssd ss
//ct==2 sssdd sssdd ss
//ct==3 ssddd ssddd ss
//ct==4 sdddd sdddd sd
//ct==5 ddddd ddddd dd
#include 
int main()
{
    int s,d;
    int ct;
   ]]></description><category></category></item><item><title><![CDATA[POJ Mobile phones（1195）（二维树状数组）]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53103290</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53103290</guid><author>ky961221</author><pubDate>Wed, 09 Nov 2016 18:27:44 +0800</pubDate><description><![CDATA[Mobile phones




Time Limit: 5000MS
 
Memory Limit: 65536K


Total Submissions: 18586
 
Accepted: 8612





Description

Suppose that the fourth generation mobile phone base stati]]></description><category></category></item><item><title><![CDATA[POJ Apple Tree (3321)(树状数组+dfs)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53103170</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53103170</guid><author>ky961221</author><pubDate>Wed, 09 Nov 2016 18:23:49 +0800</pubDate><description><![CDATA[Apple Tree




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 27309
 
Accepted: 8098





Description

There is an apple tree outside of kaka's house. Every autumn,]]></description><category></category></item><item><title><![CDATA[POJ Who Gets the Most Candies? 2886(线段树)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/53053000</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/53053000</guid><author>ky961221</author><pubDate>Sun, 06 Nov 2016 09:42:41 +0800</pubDate><description><![CDATA[Who Gets the Most Candies?




Time Limit: 5000MS
 
Memory Limit: 131072K


Total Submissions: 13876
 
Accepted: 4385


Case Time Limit: 2000MS





Description

N children are ]]></description><category></category></item><item><title><![CDATA[HUD Intersection 5120(两圆环相交求相交面积)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/52948856</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/52948856</guid><author>ky961221</author><pubDate>Thu, 27 Oct 2016 19:34:32 +0800</pubDate><description><![CDATA[Intersection
Time Limit: 4000/4000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 2754    Accepted Submission(s): 1025


Problem Description
Matt is a big f]]></description><category></category></item><item><title><![CDATA[POJ Count Color 2777(线段树)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/52937787</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/52937787</guid><author>ky961221</author><pubDate>Wed, 26 Oct 2016 20:22:40 +0800</pubDate><description><![CDATA[Count Color





Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 43739
 
Accepted: 13237





Description
Chosen Problem Solving and Program design as an optional co]]></description><category></category></item><item><title><![CDATA[SDUT 数据结构实验之二叉树一：树的同构]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/52894990</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/52894990</guid><author>ky961221</author><pubDate>Sat, 22 Oct 2016 21:26:30 +0800</pubDate><description><![CDATA[数据结构实验之二叉树一：树的同构
Time Limit: 1000MS 
Memory Limit: 65536KB
Problem Description

给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2，则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的，因为我们把其中一棵树的结点A、B、G的左右孩子互换后，就得到另外一棵树。而图2就不是同构的。

]]></description><category></category></item><item><title><![CDATA[POJ Strange Way to Express Integers 2891(扩展欧几里得)]]></title><link>https://blog.youkuaiyun.com/ky961221/article/details/52842013</link><guid>https://blog.youkuaiyun.com/ky961221/article/details/52842013</guid><author>ky961221</author><pubDate>Mon, 17 Oct 2016 21:37:07 +0800</pubDate><description><![CDATA[Strange Way to Express Integers




Time Limit: 1000MS
 
Memory Limit: 131072K


Total Submissions: 14558
 
Accepted: 4766





Description
Elina is reading a book written by Rujia ]]></description><category></category></item></channel></rss>