<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sUb_569</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sUb_569]]></copyright><item><title><![CDATA[算法导论-快排]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/115497877</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/115497877</guid><author>sUb_569</author><pubDate>Wed, 07 Apr 2021 22:22:55 +0800</pubDate><description><![CDATA[算法导论-快排
def quicksort(A,p,r):
    if  p &lt;r:
        n = partion(A,p,r)#n是基准点，A[p...n-1]&lt;=A[n]&lt;=A[n+1...r]
        #拆分为2个重复的子问题
        quicksort(A,p,n-1)
        quicksort(A,n+1,r)

def partion(A,p,r):
    x = A[r]
    i=p-1 # i表示小于x的序列的迭代器，最终的序列形]]></description><category></category></item><item><title><![CDATA[hdu1532-Drainage Ditches（最大流&EK）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54957984</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54957984</guid><author>sUb_569</author><pubDate>Thu, 09 Feb 2017 21:43:45 +0800</pubDate><description><![CDATA[Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 16292    Accepted Submission(s): 7737Problem Description 
Every time it rains o]]></description><category></category></item><item><title><![CDATA[hdu3549-Flow Problem（最大流&EK）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54954570</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54954570</guid><author>sUb_569</author><pubDate>Thu, 09 Feb 2017 19:56:38 +0800</pubDate><description><![CDATA[Flow ProblemTime Limit: 5000/5000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) 
Total Submission(s): 14791    Accepted Submission(s): 6960Problem Description 
Network flow is a well-kn]]></description><category></category></item><item><title><![CDATA[POJ1797-Heavy Transportation（Dijkstra 变式& 最大生成树）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54933528</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54933528</guid><author>sUb_569</author><pubDate>Wed, 08 Feb 2017 21:38:58 +0800</pubDate><description><![CDATA[Heavy Transportation 
Time Limit: 3000MS      Memory Limit: 30000K 
Total Submissions: 32337        Accepted: 8567 
DescriptionBackground  
Hugo Heavy is happy. After the breakdown of the Cargolifter p]]></description><category></category></item><item><title><![CDATA[POJ2253-Frogger（Dijkstra变式）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54930559</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54930559</guid><author>sUb_569</author><pubDate>Wed, 08 Feb 2017 18:28:46 +0800</pubDate><description><![CDATA[Frogger 
Time Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 40814        Accepted: 13096 
DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona F]]></description><category></category></item><item><title><![CDATA[POJ2387 - Til the Cows Come Home（Dijkstra）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54928412</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54928412</guid><author>sUb_569</author><pubDate>Wed, 08 Feb 2017 16:23:41 +0800</pubDate><description><![CDATA[Til the Cows Come Home 
Time Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 48111        Accepted: 16379 
DescriptionBessie is out in the field and wants to get back to the barn to get as]]></description><category></category></item><item><title><![CDATA[hdu1233-还是畅通工程（Kruskal）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54908713</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54908713</guid><author>sUb_569</author><pubDate>Tue, 07 Feb 2017 13:18:41 +0800</pubDate><description><![CDATA[还是畅通工程  
某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。  
Input 
测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( < 100 )；随后的N(N-1)/2行对应村庄间的距离，每]]></description><category></category></item><item><title><![CDATA[MST唯一性判断]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54907377</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54907377</guid><author>sUb_569</author><pubDate>Tue, 07 Feb 2017 12:57:58 +0800</pubDate><description><![CDATA[fzu2087 统计树边

解法（mengxiang000000 ）

如果安全，则先不Union,先统计最小生成树的边数，待统计完后再Union; 
poj1679 与此题类似

fzu2087

#include
#include
using namespace std;
const int  maxn=100005;

typedef struct node{
  int st,ed,cos]]></description><category></category></item><item><title><![CDATA[hdu1875-畅通工程再续(Kruskal )]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54908478</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54908478</guid><author>sUb_569</author><pubDate>Tue, 07 Feb 2017 12:33:25 +0800</pubDate><description><![CDATA[畅通工程再续Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 26109    Accepted Submission(s): 8459Problem Description 
相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的]]></description><category></category></item><item><title><![CDATA[POJ1251- Jungle Roads（Kruskal）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54908472</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54908472</guid><author>sUb_569</author><pubDate>Tue, 07 Feb 2017 12:30:40 +0800</pubDate><description><![CDATA[Jungle Roads 
Time Limit: 1000MS      Memory Limit: 10000K 
Total Submissions: 24836        Accepted: 11691 
DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of fore]]></description><category></category></item><item><title><![CDATA[POJ1861-Network(Kruskal)]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54899273</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54899273</guid><author>sUb_569</author><pubDate>Tue, 07 Feb 2017 00:41:08 +0800</pubDate><description><![CDATA[Network 
Time Limit: 1000MS      Memory Limit: 30000K 
Total Submissions: 16497        Accepted: 6545      Special Judge 
DescriptionAndrew is working as system administrator and is planning to establi]]></description><category></category></item><item><title><![CDATA[hdu1863-畅通工程(Prime & Kruskal)]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54895882</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54895882</guid><author>sUb_569</author><pubDate>Mon, 06 Feb 2017 18:57:18 +0800</pubDate><description><![CDATA[畅通工程Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 27327    Accepted Submission(s): 11956Problem Description 
省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通]]></description><category></category></item><item><title><![CDATA[hdu2544 -最短路（Bellman-Ford）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54894684</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54894684</guid><author>sUb_569</author><pubDate>Mon, 06 Feb 2017 16:55:12 +0800</pubDate><description><![CDATA[最短路Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 58761    Accepted Submission(s): 25851Problem Description 
在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shir]]></description><category></category></item><item><title><![CDATA[HDU2112-HDU Today(Floyd & Dijkstra)]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54882438</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54882438</guid><author>sUb_569</author><pubDate>Sun, 05 Feb 2017 18:16:47 +0800</pubDate><description><![CDATA[HDU TodayTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 26744    Accepted Submission(s): 6517Problem Description 
经过锦囊相助，海东集团终于度过了危机，从此，HDU的发]]></description><category></category></item><item><title><![CDATA[堆结构]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54866053</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54866053</guid><author>sUb_569</author><pubDate>Sat, 04 Feb 2017 21:05:16 +0800</pubDate><description><![CDATA[堆的主要操作:*建立一个堆 
*往堆里添加新元素 
*访问最大/最小值 
*删除最大/最小值模板如下:#include<cstdio>
#define MAX_SIZE 100
int A[MAX_SIZE]={0,1,2,3,4,5,6,7,8,9},N=9; //下标从1开始 void downAdjustment(int A[],int idx);//向下调整 
void buildHeap(]]></description><category></category></item><item><title><![CDATA[POJ 2533-Longest Ordered Subsequence(裸LIS)]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54864827</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54864827</guid><author>sUb_569</author><pubDate>Sat, 04 Feb 2017 18:07:34 +0800</pubDate><description><![CDATA[Longest Ordered Subsequence 
Time Limit: 2000MS      Memory Limit: 65536K 
Total Submissions: 49498        Accepted: 21975 
DescriptionA numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the s]]></description><category></category></item><item><title><![CDATA[POJ1651 Multiplication Puzzle(DP矩阵链)]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54848372</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54848372</guid><author>sUb_569</author><pubDate>Fri, 03 Feb 2017 17:24:15 +0800</pubDate><description><![CDATA[Multiplication Puzzle 
Time Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 9500     Accepted: 5906 
DescriptionThe multiplication puzzle is played with a row of cards, each containing a si]]></description><category></category></item><item><title><![CDATA[hdu1248寒冰王座（完全背包）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54834686</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54834686</guid><author>sUb_569</author><pubDate>Thu, 02 Feb 2017 07:22:46 +0800</pubDate><description><![CDATA[寒冰王座Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 16247    Accepted Submission(s): 8365Problem Description 
不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张]]></description><category></category></item><item><title><![CDATA[Codeforces761A. Dasha and Stairs]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54810211</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54810211</guid><author>sUb_569</author><pubDate>Wed, 01 Feb 2017 20:20:16 +0800</pubDate><description><![CDATA[A. Dasha and Stairs 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
On her way to programming school tiger Dasha faced her first test — a]]></description><category></category></item><item><title><![CDATA[hdu1394 -Minimum Inversion Number（线段树求逆序数）]]></title><link>https://blog.youkuaiyun.com/sUb_569/article/details/54809572</link><guid>https://blog.youkuaiyun.com/sUb_569/article/details/54809572</guid><author>sUb_569</author><pubDate>Wed, 01 Feb 2017 16:58:01 +0800</pubDate><description><![CDATA[Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 19106    Accepted Submission(s): 11520Problem Description 
The inversio]]></description><category></category></item></channel></rss>