猿的进化

http://acm.hdu.edu.cn/showproblem.php?pid=3416Marriage Match IVTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2948    Accepte

hdu5520 Number LinkTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 168 Accepted Submission(s): 64Problem Description Number Link is a fam

F - Lunch TimeTime Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe campus of Nanjing University of Science and Technology can b

BarricadeTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 219    Accepted Submission(s): 57Problem DescriptionThe empire is under

Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21616 Accepted: 10919DescriptionOn a grid map there are n little men and n houses. In each uni

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7023 Accepted: 2484 Special JudgeDescriptionAs you know, all the computers used

Reactor CoolingSpecial Judge Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)Submit Statistic Next ProblemProblem Description      The terrorist gro

网购Problem:500Time Limit:3000msMemory Limit:65536KDescription 在这个信息化的时代，网购成为了最流行的购物方式，比起在大街上，顶着烈日寻找需要的商品，大多数人更愿意坐在家里，点击下鼠标，来找到喜欢的商品，并完成购物。尽管网购

C - A Plug for UNIXTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1087DescriptionYou are in charge of setting up the pre

A simple brute force problem.Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 635    Accepted Submission(s): 335Problem Description

A - A simple Gaussian elimination problem.Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4975DescriptionDragon is studying m

A - ArrestTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere are (N+1) cities on TAT island. City 0 is where police headquart

C - ControlTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4289Description　　You, the head of Department of Security, recent

hdu5294-网络流+最短路   http://acm.hdu.edu.cn/showproblem.php?pid=5294Tricks DeviceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3129   

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 22059 Accepted: 9587Case Time Limit: 5000MSDescriptionAs more and more computers ar

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

A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15409 Accepted: 5224DescriptionYou are in charge of setting up the press room for the ina

传送门 汉语题，不解释； 建图方式：建立超级源点S，超级汇点T，S指向所有点i，边的流量为i点的出货量，费用为成本，所有点i指向汇点T，流量为进货量，费用为 -收货价格，那么求一条以费用为权值的最短路时，最短路长度越小，收益会越大，因为负的就是赚的钱。 样例示意图 了解了建图，套套模板就过了啊，注意一点就是最短路小于0是才跑流量，大于等于0时结束。#include <bits/stdc+