2016年11月__txg

原创 poj 3592 Instantaneous Transference (借助强连通分量求缩点在建图spfa求最长路)

题目链接：http://poj.org/problem?id=3592DescriptionIt was long ago when we played the game Red Alert. There is a magic function for the game objects which is called instantaneous transfer. When an

2016-11-30 20:20:17 423

原创 poj 2186 Popular Cows (有向图的联通分量问题)

DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that t

2016-11-28 21:26:02 471

原创 poj 3694 Network 求割边+LAC优化（Tarjan算法）

DescriptionA network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly b

2016-11-27 15:26:56 421

转载 LCA 问题 Tarjan算法

LCA问题的一般形式：给定一棵有根树，给出若干个查询，每个查询要求指定节点u和v的最近公共祖先。LCA问题有两类解决思路:在线算法，每次读入一个查询，处理这个查询，给出答案。离线算法，一次性读入所有查询，统一进行处理，给出所有答案。一个LCA的例子如下。比如节点1和6的LCA为0。二算法思路Tarjan算法是离线算法，基于后序DFS（深度优先搜索）

2016-11-27 15:19:42 347

原创 poj 3422 Kaka's Matrix Travels (最大费用)

题目链接：点击打开链接DescriptionOn an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix travels with SUM = 0. For each travel, Kaka moves one rook from the left-upper grid

2016-11-17 18:43:17 369

原创 poj 2516 Minimum Cost (最小费用最大流)

题目链接：http://poj.org/problem?id=2516DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) whic

2016-11-17 13:44:25 885

原创 poj 2195 going home（最小费用最大流）

题目链接：http://poj.org/problem?id=2195DescriptionOn 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,

2016-11-16 17:53:28 387

原创 poj 1275 Cashier Employment

题目链接：http://poj.org/problem?id=1275DescriptionA supermarket in Tehran is open 24 hours a day every day and needs a number of cashiers to fit its need. The supermarket manager has hired you to

2016-11-12 17:25:08 412

原创 poj 3159 Candies(查分约束+堆栈优化的spfa最短路模板)

题目链接：点击打开链接DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had f

2016-11-08 21:13:32 354

原创 vj Om Nom and Dark Park

DescriptionOm Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scar

2016-11-01 21:36:50 523

原创 vj Fox and Box Accumulation

DescriptionFox Ciel has n boxes in her room. They have the same size and weight, but they might have different strength. The i-th box can hold at most xi boxes on its top (we'll call xi the st

2016-11-01 21:23:55 355

原创 vj Fox and Cross

DescriptionFox Ciel has a board with n rows and n columns. So, the board consists of n × n cells. Each cell contains either a symbol '.', or a symbol '#'.A cross on the board is a connected se

2016-11-01 21:12:44 301

原创 vj --Fox and Number Game

DescriptionFox Ciel is playing a game with numbers now.Ciel has n positive integers: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes i

2016-11-01 21:06:26 341

Vision