2017年02月_ukiy

原创 hdu1532-Drainage Ditches（最大流&EK）

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

2017-02-09 21:43:45 627

原创 hdu3549-Flow Problem（最大流&EK）

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

2017-02-09 19:56:38 466

原创 POJ1797-Heavy Transportation（Dijkstra 变式& 最大生成树）

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

2017-02-08 21:38:58 781 1

原创 POJ2253-Frogger（Dijkstra变式）

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

2017-02-08 18:28:46 419

原创 POJ2387 - Til the Cows Come Home（Dijkstra）

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

2017-02-08 16:23:41 480

原创 hdu1233-还是畅通工程（Kruskal）

还是畅通工程某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( < 100 )；随后的N(N-1)/2行对应村庄间的距离，每

2017-02-07 13:18:41 428

转载 MST唯一性判断

fzu2087 统计树边解法（mengxiang000000 ）如果安全，则先不Union,先统计最小生成树的边数，待统计完后再Union; poj1679 与此题类似 fzu2087 #include #include using namespace std; const int maxn=100005; typedef struct node{ int st,ed,cos

2017-02-07 12:57:58 2477

原创 hdu1875-畅通工程再续(Kruskal )

畅通工程再续Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 26109 Accepted Submission(s): 8459Problem Description 相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的

2017-02-07 12:33:25 333

原创 POJ1251- Jungle Roads（Kruskal）

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

2017-02-07 12:30:40 356

原创 POJ1861-Network(Kruskal)

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

2017-02-07 00:41:08 352

原创 hdu1863-畅通工程(Prime & Kruskal)

畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 27327 Accepted Submission(s): 11956Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通

2017-02-06 18:57:18 385

原创 hdu2544 -最短路（Bellman-Ford）

最短路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

2017-02-06 16:55:12 378

原创 HDU2112-HDU Today(Floyd & Dijkstra)

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的发

2017-02-05 18:16:47 447

原创堆结构

堆的主要操作:*建立一个堆 *往堆里添加新元素 *访问最大/最小值 *删除最大/最小值模板如下:#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(

2017-02-04 21:05:16 425

原创 POJ 2533-Longest Ordered Subsequence(裸LIS)

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

2017-02-04 18:07:34 435

原创 POJ1651 Multiplication Puzzle(DP矩阵链)

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

2017-02-03 17:24:15 285

原创 hdu1248寒冰王座（完全背包）

寒冰王座Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16247 Accepted Submission(s): 8365Problem Description 不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张

2017-02-02 07:22:46 451

原创 Codeforces761A. Dasha and Stairs

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

2017-02-01 20:20:16 706

原创 hdu1394 -Minimum Inversion Number（线段树求逆序数）

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

2017-02-01 16:58:01 377

原创 Codeforces761B. Dasha and friends (KMP)

B. Dasha and friends time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Running with barriers on the circle track is very popular in the coun

2017-02-01 09:04:47 419