Dust_heart的博客

DrainageDitchesTime Limit: 2000/1000 MS(Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16953    Accepted Submission(s): 8019Problem DescriptionEvery time it

HDOJ 4975 A simple Gaussian elimination problem【最大流Dinic+判环】Dragonis studying math. One day, he drew a table with several rows and columns,randomly wrote numbers on each elements of the table. Then he counted the sumof each row and column. Since he though

HDU 2732 Leapin' Lizards 【最大流Dinic】Problem DescriptionYour platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are looking around for hidden treasures, one of the rookies steps on an innocent-looking stone a

HDU 6214 Smallest Minimum Cut 【最小割】2017 ACM/ICPC Asia Regional Qingdao Online Consider a network G=(V,E) with source s and sink t. An s-t cut isa partition of nodes set V intotwo parts such that s and t belong todifferent parts. The cut set is the subset