<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sdjzujxc的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sdjzujxc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sdjzujxc]]></copyright><item><title><![CDATA[并查集]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8833746</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8833746</guid><author>sdjzujxc</author><pubDate>Mon, 22 Apr 2013 11:50:30 +0800</pubDate><description><![CDATA[Almost Union-Find

I hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.
The data structure you need to write is also a coll]]></description><category></category></item><item><title><![CDATA[uva  10972 类似poj 3352]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8833688</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8833688</guid><author>sdjzujxc</author><pubDate>Mon, 22 Apr 2013 11:44:07 +0800</pubDate><description><![CDATA[RevolC FaeLoN
Hopefully, you can remember Koorosh from one of the previous problems. Fortunately, Koorosh has solved Basm’s problem without your help! Now, he is a high-ranked advisor of Basm.
 As u]]></description><category></category></item><item><title><![CDATA[hdu 3861]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8833609</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8833609</guid><author>sdjzujxc</author><pubDate>Mon, 22 Apr 2013 11:27:34 +0800</pubDate><description><![CDATA[The King’s Problem
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1091    Accepted Submission(s): 404



Problem Description
 
In the]]></description><category></category></item><item><title><![CDATA[uva 10600 最小与次小生成树]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8776712</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8776712</guid><author>sdjzujxc</author><pubDate>Tue, 09 Apr 2013 11:20:34 +0800</pubDate><description><![CDATA[Problem A
ACM CONTEST AND BLACKOUT

 
In order to prepare the “The First National ACM School Contest”(in 20??) the major of the city decided to provide all the schools with a reliable source of po]]></description><category></category></item><item><title><![CDATA[poj  2352]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8774505</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8774505</guid><author>sdjzujxc</author><pubDate>Mon, 08 Apr 2013 20:29:03 +0800</pubDate><description><![CDATA[Stars




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 25160
 
Accepted: 10983




Description
Astronomers often examine star maps where stars are represented by po]]></description><category></category></item><item><title><![CDATA[Hdu  1166 敌兵布阵（基本树状数组的运用）]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8774248</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8774248</guid><author>sdjzujxc</author><pubDate>Mon, 08 Apr 2013 19:40:21 +0800</pubDate><description><![CDATA[敌兵布阵
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25174    Accepted Submission(s): 10883


Problem Description
C国的死对头A国这段时间正在进行军事演习，所以]]></description><category></category></item><item><title><![CDATA[poj 2395]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8739982</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8739982</guid><author>sdjzujxc</author><pubDate>Sat, 30 Mar 2013 14:19:16 +0800</pubDate><description><![CDATA[Out of Hay




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 9114
 
Accepted: 3473




Description
The cows have run out of hay, a horrible event that must be remedi]]></description><category></category></item><item><title><![CDATA[poj 1861]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8726475</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8726475</guid><author>sdjzujxc</author><pubDate>Wed, 27 Mar 2013 14:28:39 +0800</pubDate><description><![CDATA[Network




Time Limit: 1000MS
 
Memory Limit: 30000K


Total Submissions: 11156
 
Accepted: 4246
 
Special Judge




Description
Andrew is working as system administrator and is p]]></description><category></category></item><item><title><![CDATA[zoj  3204 字典序最小的最小生成树的输出]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8726195</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8726195</guid><author>sdjzujxc</author><pubDate>Wed, 27 Mar 2013 13:37:45 +0800</pubDate><description><![CDATA[Connect them

Time Limit: 1 Second      Memory Limit: 32768 KB

You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are]]></description><category></category></item><item><title><![CDATA[zoj 3497]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8720573</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8720573</guid><author>sdjzujxc</author><pubDate>Tue, 26 Mar 2013 10:39:22 +0800</pubDate><description><![CDATA[Mistwald

Time Limit: 2 Seconds      Memory Limit: 65536 KB

In chapter 4 of the game Trails in the Sky SC, Estelle Bright and her friends are crossing Mistwald to meet their final enemy, Lucciola]]></description><category></category></item><item><title><![CDATA[poj 2337]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8710682</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8710682</guid><author>sdjzujxc</author><pubDate>Sat, 23 Mar 2013 19:13:23 +0800</pubDate><description><![CDATA[Catenyms




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 7869
 
Accepted: 2068




Description
A catenym is a pair of words separated by a period such that the las]]></description><category></category></item><item><title><![CDATA[poj  1386]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8701677</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8701677</guid><author>sdjzujxc</author><pubDate>Thu, 21 Mar 2013 15:52:02 +0800</pubDate><description><![CDATA[Play on Words




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 7877
 
Accepted: 2778




Description
Some of the secret doors contain a very interesting word puzzle]]></description><category></category></item><item><title><![CDATA[poj  3509]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8688415</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8688415</guid><author>sdjzujxc</author><pubDate>Mon, 18 Mar 2013 18:41:41 +0800</pubDate><description><![CDATA[Rotating Rings




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 1707
 
Accepted: 650




Description









1
1
1
1
1


1
2
2
2
1


1
2]]></description><category></category></item><item><title><![CDATA[hdu1013]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8684331</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8684331</guid><author>sdjzujxc</author><pubDate>Sun, 17 Mar 2013 18:42:46 +0800</pubDate><description><![CDATA[Digital Roots
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35452    Accepted Submission(s): 10849



Problem Description

The digita]]></description><category></category></item><item><title><![CDATA[poj  3510]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8684145</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8684145</guid><author>sdjzujxc</author><pubDate>Sun, 17 Mar 2013 17:15:40 +0800</pubDate><description><![CDATA[A Tale from the Dark Side of the Moon




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 2623
 
Accepted: 742




Description

Us: So why don’t you just recompile th]]></description><category></category></item><item><title><![CDATA[hdu  1497]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8684126</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8684126</guid><author>sdjzujxc</author><pubDate>Sun, 17 Mar 2013 17:08:02 +0800</pubDate><description><![CDATA[Simple Library Management System
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1149    Accepted Submission(s): 333




Problem Descrip]]></description><category></category></item><item><title><![CDATA[SDUT 第九周周赛]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8681678</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8681678</guid><author>sdjzujxc</author><pubDate>Sat, 16 Mar 2013 17:37:23 +0800</pubDate><description><![CDATA[Fermat’s Chirstmas Theorem 


Time Limit: 1000MS Memory limit: 65536K 

题目描述
In a letter dated December 25, 1640; the great mathematician Pierre de Fermat wrote to Marin Mersenne that he just pr]]></description><category></category></item><item><title><![CDATA[zoj  2975]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8680326</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8680326</guid><author>sdjzujxc</author><pubDate>Sat, 16 Mar 2013 09:40:53 +0800</pubDate><description><![CDATA[Kinds of Fuwas

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 

In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China as well as becomin]]></description><category></category></item><item><title><![CDATA[poj  1008]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8665639</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8665639</guid><author>sdjzujxc</author><pubDate>Tue, 12 Mar 2013 21:23:49 +0800</pubDate><description><![CDATA[Maya Calendar




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 56887
 
Accepted: 17567




Description
During his last sabbatical, professor M. A. Ya made a surpris]]></description><category></category></item><item><title><![CDATA[poj  2400 最小权匹配+匹配输出]]></title><link>https://blog.youkuaiyun.com/sdjzujxc/article/details/8646213</link><guid>https://blog.youkuaiyun.com/sdjzujxc/article/details/8646213</guid><author>sdjzujxc</author><pubDate>Thu, 07 Mar 2013 13:51:01 +0800</pubDate><description><![CDATA[Supervisor, Supervisee




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 2055
 
Accepted: 581




Description
Suppose some supervisors each get to hire a new person]]></description><category></category></item></channel></rss>