海绵的博客

竞赛虐我千百遍,我待竞赛如初恋。 Never Give Up!!!

排序:
默认
按更新时间
按访问量

Smallest Minimum Cut hdu-6214

Problem Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t b...

2018-09-13 11:25:11

阅读数:13

评论数:0

Sewage Treatment HihoCoder - 1389 (二分+网络流+剪枝) SAP

After years of suffering, people could not tolerate the pollution in the city any more, and started a long-lasting protest. Eventually, the municipal...

2018-09-11 18:59:17

阅读数:26

评论数:0

Matrix Decompressing UVA - 11082 (SAP模板)

#include<cstdio> #include<algorithm> #include<iostream> #include<algor...

2018-06-10 21:01:45

阅读数:24

评论数:0

Plug for UNIX UVA - 753

#include<cstdio> #include<algorithm> #include<iostream> #include<algorit...

2018-06-10 20:03:55

阅读数:24

评论数:0

Going Home(二分图匹配)

On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to...

2018-05-03 10:42:18

阅读数:11

评论数:0

Farm Tour(最小费用最大流)

DescriptionWhen FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields ...

2018-05-01 22:24:36

阅读数:20

评论数:0

Base Station (最大权闭合图问题)

Problem DescriptionA famous mobile communication company is planning to build a new set of base stations. According to the previous investigation, n ...

2018-05-01 17:55:15

阅读数:21

评论数:0

Drainage Ditches

Problem Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is cove...

2018-04-24 14:46:02

阅读数:16

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭