mymilkbottles

越努力,越幸运! 以现在大多数人的努力程度之低,根本轮不到可以拼天赋。...

LightOJ 1356 Prime Independence (素数+二分图)

B - Prime Independence Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluDescriptionA set of integers is called prime in...

2016-09-23 16:14:05

阅读数:706

评论数:0

hdu5883 The Best Path(欧拉通路、欧拉回路)

The Best Path Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Problem Description Alice is planning her travel r...

2016-09-21 23:29:58

阅读数:412

评论数:0

hdu5876 Sparse Graph(补图上求最短路)

Sparse Graph Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem Description In graph theory, the compleme...

2016-09-11 13:44:59

阅读数:147

评论数:0

poj3177 Redundant Paths(边双联通)

Redundant PathsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13206Accepted: 5624DescriptionIn order to get from one of the F (1 <= F &l...

2016-09-07 20:11:09

阅读数:132

评论数:0

poj3352 Road Construction(加最少边使图双联通)

Road ConstructionTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 11087Accepted: 5513DescriptionIt’s almost summer time, and that means that ...

2016-09-07 14:36:34

阅读数:116

评论数:0

Codeforces Round #369 (Div. 2) 711D Directed Roads (dfs)

D. Directed Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Bab...

2016-08-30 23:23:59

阅读数:305

评论数:0

UVALive - 3902 Network

大白书的34页就是这道题。 附上链接: http://acm.hust.edu.cn/vjudge/problem/16451Consider a tree network with n nodes where the internal nodes correspond to server...

2016-08-30 18:03:06

阅读数:114

评论数:0

Hihocoder #1050 : 树中的最长路 (两次dfs 或 一次dfs)

1050 : 树中的最长路时间限制:10000ms 单点时限:1000ms 内存限制:256MB描述上回说到,小Ho得到了一棵二叉树玩具,这个玩具是由小球和木棍连接起来的,而在拆拼它的过程中,小Ho发现他不仅仅可以拼凑成一棵二叉树!还可以拼凑成一棵多叉树——好吧,其实就是更为平常的树而已。但是...

2016-08-23 23:48:06

阅读数:484

评论数:0

HDU 5727 Necklace (全排列+二分图最大匹配)

NecklaceTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2441    Accepted Submission(s): 772Pr...

2016-08-22 18:46:46

阅读数:318

评论数:0

hdu5723 Abandoned country (最小生成树+期望)

Abandoned country Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem Description An abandoned country has n...

2016-08-21 15:02:42

阅读数:197

评论数:0

湖南省第七届省赛 G - 最优对称路径(spfa+dp)

G - 最优对称路径 Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu Submit StatusDescription 给一个n行n列的网格,每个格子里有一个1到9的数字。你需要从...

2016-08-20 14:58:43

阅读数:261

评论数:0

UVA11324 The Largest Clique (强联通+缩点+DAG上DP最长路)

Given a directed graph G, con- sider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Cre- ate a di...

2016-08-19 11:57:18

阅读数:141

评论数:0

HDU4612 Warm up(强联通分量+缩点重构图后求树的直径)

Warm upTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 6132    Accepted Submission(s): 1385P...

2016-08-19 00:41:42

阅读数:175

评论数:0

hdu2767 Proving Equivalences (加边成为强联通分量)

Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5782    Accepted Submissi...

2016-08-18 22:20:55

阅读数:159

评论数:0

HDU1269 迷宫城堡 (强联通分量)

迷宫城堡Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12914    Accepted Submission(s): 5772Prob...

2016-08-18 19:50:25

阅读数:157

评论数:0

poj2186 Popular Cows (强联通分量+缩点)

Popular CowsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 30641Accepted: 12432DescriptionEvery cow’s dream is to become the most popular c...

2016-08-18 17:46:55

阅读数:151

评论数:0

UVA10054 The Necklace (输出欧拉回路)

My little sister had a beautiful necklace made of colorful beads. Two successive beads in the necklace shared a common color at their meeting point....

2016-08-18 00:34:26

阅读数:132

评论数:0

Codeforces Beta Round #95 (Div. 2) Subway (树上找环)

D. Subway time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputA subway scheme, class...

2016-08-17 13:58:39

阅读数:179

评论数:0

poj2516 Minimum Cost(多源多汇的mcmf)

Minimum Cost Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 15905 Accepted: 5560Description Dearboy, a goods victualer, no...

2016-08-16 10:31:57

阅读数:365

评论数:0

POJ3680 Intervals (区间K覆盖问题)

IntervalsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 7606Accepted: 3195DescriptionYou are given N weighted open intervals. The ith inter...

2016-08-15 20:56:59

阅读数:220

评论数:0

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