与‘图论(网络流)-最大流’有关的日志

poj1966

maksyuki 发表于 oj 分类,标签: , ,
0
poj1966

Cable TV Network

The interconnection of the relays in a cable TV network is bi-directional. The network is connected if there is at least one interconnection path between each pair of relays present in the network. Otherwise the network is disconne >>继续阅读

poj2125

maksyuki 发表于 oj 分类,标签: , ,
0
poj2125

Destroying The Graph

Alice and Bob play the following game. First, Alice draws some directed graph with N vertices and M arcs. After that Bob tries to destroy it. In a move he may take any vertex of the graph and remove either all arcs incoming int >>继续阅读

poj3308

maksyuki 发表于 oj 分类,标签: ,
0
poj3308

Paratroopers

It is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in the m × n grid >>继续阅读

poj3436

maksyuki 发表于 oj 分类,标签:
0
poj3436

ACM Computer Factory

As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at the same factory. >>继续阅读

poj2391

maksyuki 发表于 oj 分类,标签: , ,
0
poj2391

Ombrophobic Bovines

FJ's cows really hate getting wet so much that the mere thought of getting caught in the rain makes them shake in their hooves. They have decided to put a rain siren on the farm to let them know when rain is approaching. They in >>继续阅读

poj1087

maksyuki 发表于 oj 分类,标签:
0
poj1087

A Plug for UNIX

You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the free flow of information and ideas on the Internet as cumbersom >>继续阅读

poj2112

maksyuki 发表于 oj 分类,标签: ,
0
poj2112

Optimal Milking

FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milking machines. The milking machine locations >>继续阅读

poj3469

maksyuki 发表于 oj 分类,标签: ,
0
poj3469

Dual Core CPU

As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW. >>继续阅读

poj1637

maksyuki 发表于 oj 分类,标签:
0
poj1637

Sightseeing tour

The city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautiful city. They want to construct the tour so that every street in the city is visited exactly >>继续阅读

poj1459

maksyuki 发表于 oj 分类,标签:
0
poj1459

Power Network

A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 <= p(u) <= pmax(u) of power >>继续阅读

poj1273

maksyuki 发表于 oj 分类,标签:
0
poj1273

Drainage Ditches

Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of dr >>继续阅读

poj1149

maksyuki 发表于 oj 分类,标签:
0
poj1149

PIGS

Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to some pig-houses and wants to buy a cert >>继续阅读

hdu3549

maksyuki 发表于 oj 分类,标签:
0
hdu3549

Flow Problem

Problem Description

Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.

Input >>继续阅读