2015年08月_笑着走完自己的路

原创 hdoj 3820 Golden Eggs 【双二分图构造最小割模型】

Golden EggsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 505 Accepted Submission(s): 284Problem DescriptionThere is a grid

2015-08-31 22:06:25 766

原创 hdoj 3657 Game 【最小割方格填数加强版】

GameTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1076 Accepted Submission(s): 456Problem Descriptiononmylove has invented

2015-08-31 20:09:04 953

原创 hdoj 2157 How many ways?? 【矩阵快速幂】【求任意两点间的路径上经过k个点的方案数】

How many ways??Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2102 Accepted Submission(s): 771Problem Description春天到了, HDU校园

2015-08-31 17:24:36 1486

原创 hdoj 4062 Queuing 【矩阵快速幂优化递推公式】

QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3609 Accepted Submission(s): 1629Problem DescriptionQueues and Priori

2015-08-31 16:43:06 807

原创 hdoj 1575 Tr A 【矩阵快速幂】

Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3690 Accepted Submission(s): 2755Problem DescriptionA为一个方阵，则Tr A表示A的迹（就是主

2015-08-31 13:17:16 400

原创 hdoj 4322 Candy 【最大费用最大流】【经典题目】【最大流时维护费用的最大效益】

CandyTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1829 Accepted Submission(s): 500Problem DescriptionThere are N candies a

2015-08-31 11:10:37 941 1

原创 poj 2375 Cow Ski Area 【SCC缩点求最少增加几条边使图强连通】

Cow Ski AreaTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2868 Accepted: 823DescriptionFarmer John's cousin, Farmer Ron, who lives in the mountains of

2015-08-30 22:08:04 662

原创 hdoj 1757 A Simple Math Problem 【矩阵快速幂】

A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3528 Accepted Submission(s): 2133Problem DescriptionLele

2015-08-30 21:29:11 487

原创矩阵快速幂【模板】

引子：求解一个N*N矩阵的 M次幂。

2015-08-30 20:11:15 755

原创 poj 3070 Fibonacci 【矩阵快速幂求第N个斐波那契数%1000】

FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11123 Accepted: 7913DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn

2015-08-30 20:01:11 2850

原创 +_+ +_+ +_+

不在系统刷网络流啦，表示已经刷晕了，我想静静。保证以后一天一道网络流，毕竟还要继续学习其他的。有一种很强烈的感觉——再刷两天网络流，我就凌乱了。。。 o(╯□╰)o

2015-08-30 18:01:15 512

原创 hdoj 2282 Chocolate 【最小费用最大流】

ChocolateTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 565 Accepted Submission(s): 281Problem DescriptionLethe loves eating

2015-08-30 17:42:57 1005

原创 hdoj 3987 Harry Potter and the Forbidden Forest 【求所有最小割里面最少的边数】

Harry Potter and the Forbidden ForestTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1802 Accepted Submission(s): 602Problem Desc

2015-08-30 11:57:00 1930

原创 hdoj 3395 Special Fish 【最大费用流】

Special FishTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1920 Accepted Submission(s): 717Problem DescriptionThere is a kin

2015-08-30 02:05:32 1063

原创 hdoj 2883 kebab 【时间区间离散化 + 最大流】

kebabTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1271 Accepted Submission(s): 531Problem DescriptionAlmost everyone likes

2015-08-30 00:36:49 1209

原创 hdoj 2435 There is a war 【求原图最小割已经分成的两个点集 + 枚举两点集里面的点建新边求残量网络的最大最小割】

There is a warTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 993 Accepted Submission(s): 283Problem Description There i

2015-08-29 22:25:31 1017

原创 hdoj 3251 Being a Hero 【建图后求解最小割 + 输出任意一组最小割里面边的编号】

Being a HeroTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1252 Accepted Submission(s): 395Special JudgeProblem Description

2015-08-29 18:51:30 809

原创 hdoj 4292 Food 【拆点网络流】

FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3851 Accepted Submission(s): 1289Problem Description　　You, a part-time di

2015-08-28 22:36:33 827

原创 hdoj 4289 Control 【拆点求最小割】

ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2295 Accepted Submission(s): 961Problem Description　　You, the head of

2015-08-28 21:33:48 873

原创 poj 3189 Steady Cow Assignment 【最大流】【枚举上下界判断是否满流】

Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6029 Accepted: 2083DescriptionFarmer John's N (1 FJ would like to rearrange the

2015-08-28 18:27:57 699

原创 poj 1698 Alice's Chance 【最大流判断是否满流】

Alice's ChanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6386 Accepted: 2609DescriptionAlice, a charming girl, have been dreaming of being a movie

2015-08-28 12:56:06 699

原创 zoj 2587 Unique Attack 【判断最小割是否唯一】

Unique AttackTime Limit: 5 Seconds Memory Limit: 32768 KBN supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different pai

2015-08-28 10:44:24 1702

原创 zoj 3362 Beer Problem 【最大费用最大流需要判断最长路值是否为负】

Beer ProblemTime Limit: 2 Seconds Memory Limit: 32768 KBEveryone knows that World Finals of ACM ICPC 2004 were held in Prague. Besides its greatest architecture and culture, Prague is wor

2015-08-28 01:26:02 1833 1

原创 hdoj 2246 Interesting Housing Problem 【最大费用最大流 or KM算法】

Interesting Housing ProblemTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2726 Accepted Submission(s): 986Problem Description

2015-08-28 00:11:19 791 2

原创 poj 2516 Minimum Cost 【最小费用最大流】【求解K种物品的最小费用，独立求解累加每个结果】

Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 15010 Accepted: 5154DescriptionDearboy, a goods victualer, now comes to a big problem, and h

2015-08-27 20:35:39 968

原创 poj 2135 Farm Tour 【最小费用最大流】

Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13464 Accepted: 5101DescriptionWhen FJ's friends visit him on the farm, he likes to show them a

2015-08-27 17:02:17 1052

原创 hdoj 3667 Transportation 【拆边 + 最小费用最大流】

TransportationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2413 Accepted Submission(s): 1031Problem DescriptionThere are N

2015-08-27 16:11:28 702

原创 poj 3228 Gold Transportation 【二分 + 最大流判断是否满流】

Gold TransportationTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3077 Accepted: 1100DescriptionRecently, a number of gold mines have been discovered i

2015-08-27 10:58:27 550

原创 hdoj 3046 Pleasant sheep and big big wolf 【最小割】

Pleasant sheep and big big wolfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2570 Accepted Submission(s): 1056Problem Descripti

2015-08-27 10:00:50 886

原创 poj 2455 Secret Milking Machine 【二分 + 最大流】【1到N不重复路径不少于T条时，求被选中路径上的最大边权值的最小值】

Secret Milking MachineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10620 Accepted: 3110DescriptionFarmer John is constructing a new milking machine a

2015-08-27 01:36:45 2310 2

原创 zoj 3885 The Exchange of Items 【最小费用最大流】

The Exchange of ItemsTime Limit: 2 Seconds Memory Limit: 65536 KBBob lives in an ancient village, where transactions are done by one item exchange with another. Bob is very clever and he

2015-08-27 00:40:24 2138 1

原创 poj 3422 Kaka's Matrix Travels 【最大费用最大流】【好题】

Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8729 Accepted: 3498DescriptionOn an N × N chessboard with a non-negative number in

2015-08-27 00:17:46 1275 1

原创关于最大费用最大流的一类问题【小谈】

错误的地方欢迎指正！！！O(∩_∩)O~~引子：我们默认把一个点可以拆为左点和右点情况一：每个点只能走一次（除了起点和终点可以走多次），问你走2次获取的最大权值和。1，对可达边处理，明确一下当选择一个点的左点或者右点时，都说明你选择了走这个点。我们会考虑四种情况，题目要求————每个点只能走一次。所以我们如果选择一个点就必须要获取它的点权(1)u的左

2015-08-27 00:03:47 3700 2

原创 poj 2289 Jamie's Contact Groups 【二分 + 最大流】

Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 6898 Accepted: 2260DescriptionJamie is a very popular girl and has quite a lot of

2015-08-26 23:24:29 865

原创 hdoj 4009 Transfer water 【求无根树最小树形图】

Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4402 Accepted Submission(s): 1564Problem DescriptionXiaoA lives

2015-08-26 16:20:29 675

原创 hdoj 2121 Ice_cream’s world II 【虚拟源点求无根树的最小树形图】

Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3574 Accepted Submission(s): 859Problem DescriptionAfter

2015-08-26 13:39:01 733

原创 poj 3164 Command Network 【最小树形图】【朱刘算法入门】

Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 14782 Accepted: 4249DescriptionAfter a long lasting war on words, a war on arms finall

2015-08-26 10:46:58 1127 2

原创最小树形图之朱刘算法【模板】

定义：一个有向图，存在从某个点为根的，可以到达所有点的一个最小生成树，则它就是最小树形图。朱刘算法实现过程：【在选出入边集后（看步骤1），若有向图中不存在有向环，说明该图就是最小树形图】1，选入边集——找到除root点之外，每一个点的所有入边中权值最小的，用数组in[]记录下这个最小权值，用pre[]记录到达该点的前驱；（若图中存在独立点，最小树形图是不存在的，所

2015-08-26 09:20:40 4392 2

转载表白专用！！！

我相信，你会喜欢的！在大牛博客上找算法模板，不经意间发现了这个，O(∩_∩)O哈哈~ 好有趣。代码版式不是很好看，花了点时间调整了格式。原文出处：原文点这里#include #include #define N 50HANDLE hConsole;void gotoxy(int x, int y){ COORD coord;

2015-08-26 01:36:59 2201 4

原创 hdoj 3376 Matrix Again and hdoj 2686 Matrix 【最大费用最大流】

Matrix AgainTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 3453 Accepted Submission(s): 1017Problem DescriptionStarvae ver

2015-08-26 01:03:14 1142 1

Challenge-Cup

OpenGL所需的配置文件

VS2013MFC编程基础（19个专题）

空空如也