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

POJ - 1470 Closest Common Ancestors(LCA 离线tarjan)

Closest Common Ancestors Write a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determin...

2018-11-16 21:04:12

阅读数:4

评论数:0

POJ 1523 SPF (割点+连通块)

SPF   Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer...

2018-11-14 18:53:05

阅读数:36

评论数:0

POJ - 2117 Electricity(Tarjan +割点+连通块)

Electricity   Blackouts and Dark Nights (also known as ACM++) is a company that provides electricity. The company owns several power plants, each o...

2018-11-14 16:09:58

阅读数:34

评论数:0

Strongly connected (强连通分量 Tarjan+缩点)

Strongly connected   Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the gra...

2018-11-13 19:58:54

阅读数:29

评论数:0

Critical Links (Tarjan 求割边)

Critical Links In a computer network a link L, which interconnects two servers, is  considered critical if there are at least two servers A and B s...

2018-11-13 13:14:27

阅读数:22

评论数:0

POJ1236 Network of Schools (强连通分量 Tarjan+缩点)

 Network of Schools A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintai...

2018-11-12 21:52:51

阅读数:16

评论数:0

HDU1269 迷宫城堡 (强连通分量 Tarjan)

迷宫城堡 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由...

2018-11-12 21:10:49

阅读数:15

评论数:0

Network (Tarjan求割点个数)

Describle A Telephone Line Company (TLC) is establishing a new telephone cable  network. They are connecting several places numbered by integers from...

2018-11-10 09:35:03

阅读数:36

评论数:0

ACM Computer Factory (拆点+EK算法)

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 ...

2018-11-05 20:29:31

阅读数:13

评论数:0

POJ 1459 Power Network (多源点最大流 EK)

A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an am...

2018-11-05 20:01:51

阅读数:22

评论数:0

Drainage Ditches (最大流 EK dinic)

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 cov...

2018-11-03 21:47:42

阅读数:26

评论数:0

NYIST--2018大一新生第一次周赛题解

比赛链接:https://cn.vjudge.net/contest/261258  密码:nyist  A - Thickest Burger    厚的肉排乘2加上薄的肉排 #include<stdio.h> int main() { ...

2018-10-13 17:32:15

阅读数:433

评论数:0

Can you answer these queries? (线段树)

Can you answer these queries?   A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weap...

2018-09-27 21:04:54

阅读数:57

评论数:0

Balanced Lineup (线段树)

Balanced Lineup   For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to org...

2018-09-23 16:56:24

阅读数:10

评论数:0

Just a Hook (线段树)

Just a Hook   In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several con...

2018-09-23 16:04:58

阅读数:22

评论数:0

A Simple Problem with Integers POJ - 3468(线段树)

 A Simple Problem with Integers You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to ad...

2018-09-23 11:04:10

阅读数:11

评论数:0

I Hate It HDU - 1754 (线段树)

I Hate It 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。  这让很多学生很反感。  不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input 本题目包含多组测试,请处理...

2018-09-23 11:01:24

阅读数:8

评论数:0

Doing Homework again (贪心)

Doing Homework again  Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadl...

2018-08-17 11:13:55

阅读数:18

评论数:0

Cleaning Shifts(贪心)

Cleaning Shifts Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He ...

2018-08-17 10:51:58

阅读数:20

评论数:0

Crossing River (贪心)

 Crossing River A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shut...

2018-08-17 10:34:40

阅读数:25

评论数:0

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