<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u014366015的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u014366015</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u014366015]]></copyright><item><title><![CDATA[To the Max-动态规划 树状数组]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24926211</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24926211</guid><author>u014366015</author><pubDate>Sat, 03 May 2014 16:58:22 +0800</pubDate><description><![CDATA[To the Max
问题来源:hdu-1050

Description
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole a]]></description><category></category></item><item><title><![CDATA[Maximum Clique-最大团dfs]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24843475</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24843475</guid><author>u014366015</author><pubDate>Thu, 01 May 2014 16:00:54 +0800</pubDate><description><![CDATA[Maximum Clique
问题来源:hdu-1530

Problem Description
Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there exists an edge (v1, v2) in e. Maximum cliq]]></description><category></category></item><item><title><![CDATA[Machine Schedule-匈牙利算法/Dinic]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24811869</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24811869</guid><author>u014366015</author><pubDate>Wed, 30 Apr 2014 20:31:32 +0800</pubDate><description><![CDATA[Machine Schedule
问题来源:Hdu-1150

Problem Description
As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling prob]]></description><category></category></item><item><title><![CDATA[迷宫城堡-Tarjin]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24810417</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24810417</guid><author>u014366015</author><pubDate>Wed, 30 Apr 2014 19:22:39 +0800</pubDate><description><![CDATA[迷宫城堡
问题来源:hdu-1269

Problem Description
为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N

Input
输入包含多组数据，输入的第一行有两个数：N和M，接下来的M行每行有两个数a和b，表示了一条通道可以从A房间来到B房间。文件最后以两个0结束。
 
Output
对于输入的每组数据，如果任意两个房间都是相互连接的，输]]></description><category></category></item><item><title><![CDATA[炮兵阵地-动态规划/状态压缩/位运算]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24668397</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24668397</guid><author>u014366015</author><pubDate>Mon, 28 Apr 2014 21:09:08 +0800</pubDate><description><![CDATA[炮兵阵地
问题来源:POJ-1185

Description
司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队（山地上不能够部署炮兵部队）；一支炮兵部队在地图上的攻击范围如图中黑色区域所示：
如果在地图中的灰色所标识的平原上]]></description><category></category></item><item><title><![CDATA[Farm Tour-最小费用最大流/SPFA]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24529837</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24529837</guid><author>u014366015</author><pubDate>Sat, 26 Apr 2014 14:00:17 +0800</pubDate><description><![CDATA[Farm Tour
问题来源:poj-2135


Description
When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contain]]></description><category></category></item><item><title><![CDATA[How to earn more-最小割/FordFulkerson/Dinic]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24330571</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24330571</guid><author>u014366015</author><pubDate>Tue, 22 Apr 2014 22:44:05 +0800</pubDate><description><![CDATA[How to earn more
Source:HOJ-2634

Xiao Ming is an expert in computer science and technology, so he can get a lot of projects every month. The projects always bring him a lot of money, now he is thi]]></description><category></category></item><item><title><![CDATA[Dining-最大流/Dinic]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24328541</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24328541</guid><author>u014366015</author><pubDate>Tue, 22 Apr 2014 21:49:04 +0800</pubDate><description><![CDATA[Dining
Source:POJ-3281

Description
Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meals for h]]></description><category></category></item><item><title><![CDATA[Optimal Milking-最大流/FordFulkerson/Dinic]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24328379</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24328379</guid><author>u014366015</author><pubDate>Tue, 22 Apr 2014 21:46:08 +0800</pubDate><description><![CDATA[Optimal Milking
Source:POJ-2112

Description
FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs a]]></description><category></category></item><item><title><![CDATA[Humble Numbers-类DP]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24328323</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24328323</guid><author>u014366015</author><pubDate>Tue, 22 Apr 2014 21:41:40 +0800</pubDate><description><![CDATA[Humble Numbers
Source:hdu-1058

Problem Description
A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, ]]></description><category></category></item><item><title><![CDATA[归并排序-分治法]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/24113041</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/24113041</guid><author>u014366015</author><pubDate>Sat, 19 Apr 2014 15:19:46 +0800</pubDate><description><![CDATA[import java.util.Scanner;
import java.util.Random;

class Sort {	//归并排序
	int[] a;
	int[] t;
	
	public void setNum( int N ){
		Random rand = new Random( );
		
		a = new int[N];
		t = new int[N];
		
		f]]></description><category></category></item><item><title><![CDATA[最少拦截系统-动态规划LIS]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23781021</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23781021</guid><author>u014366015</author><pubDate>Tue, 15 Apr 2014 19:16:11 +0800</pubDate><description><![CDATA[问题来源:hdu-1257
最少拦截系统

Problem Description
某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易]]></description><category></category></item><item><title><![CDATA[PiggyBank-完全背包]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23708631</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23708631</guid><author>u014366015</author><pubDate>Mon, 14 Apr 2014 21:59:37 +0800</pubDate><description><![CDATA[Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10191    Accepted Submission(s): 5134


Problem Description
Before ACM can do ]]></description><category></category></item><item><title><![CDATA[BoneCollector-01背包]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23671821</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23671821</guid><author>u014366015</author><pubDate>Mon, 14 Apr 2014 13:07:27 +0800</pubDate><description><![CDATA[问题来源：hdu-

Bone Collector

Problem Description
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow]]></description><category></category></item><item><title><![CDATA[敌兵布阵-树状数组]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23587043</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23587043</guid><author>u014366015</author><pubDate>Sun, 13 Apr 2014 08:10:53 +0800</pubDate><description><![CDATA[问题来源：hdu-1166
敌兵布阵
Problem Description
C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或]]></description><category></category></item><item><title><![CDATA[Count the Trees-卡特兰数\高精度乘法]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23561163</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23561163</guid><author>u014366015</author><pubDate>Sat, 12 Apr 2014 22:47:36 +0800</pubDate><description><![CDATA[问题来源：hdu-1131

Count the Trees

Problem Description
Another common social inability is known as ACM (Abnormally Compulsive Meditation). This psychological disorder is somewhat common among progra]]></description><category></category></item><item><title><![CDATA[过山车-匈牙利算法]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23118327</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23118327</guid><author>u014366015</author><pubDate>Mon, 07 Apr 2014 17:15:44 +0800</pubDate><description><![CDATA[过山车
问题来源:hdu-2063
Problem Description
RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只愿意和linle或LL做p]]></description><category></category></item><item><title><![CDATA[最大流-FoldFulkerson算法]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23102469</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23102469</guid><author>u014366015</author><pubDate>Mon, 07 Apr 2014 14:19:06 +0800</pubDate><description><![CDATA[问题来源:hdu-1532
问题描述:约翰是个农民,每次下雨的时候他的庄家总是会被淹没,这就意味着当庄家被水淹后需要很长时间才能重新生长出来,因此,约翰已经建立了一系列排水管道为了使他的庄家尽可能被淹没的最少,也就是说管道的排水量必须很大.作为一名工程师,约翰可以计算出管道网能排水的最大能力.
Input:输入包含多组用例,每组用例第一行是两个数N,M,N表示一共有N个管道,M表示一共有M个点]]></description><category></category></item><item><title><![CDATA[畅通工程-Floyed算法]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23033613</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23033613</guid><author>u014366015</author><pubDate>Sun, 06 Apr 2014 16:38:41 +0800</pubDate><description><![CDATA[畅通工程续
问题来源：hdu-1874
Problem Description
某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。
现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。

Input
本题目包含多组数据，请处]]></description><category></category></item><item><title><![CDATA[最短路径问题-Dijstra]]></title><link>https://blog.youkuaiyun.com/u014366015/article/details/23032749</link><guid>https://blog.youkuaiyun.com/u014366015/article/details/23032749</guid><author>u014366015</author><pubDate>Sun, 06 Apr 2014 16:22:22 +0800</pubDate><description><![CDATA[最短路径问题
问题来源：hdu-3790


Problem Description
给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。
 
Input
输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个]]></description><category></category></item></channel></rss>