- 博客(13)
- 资源 (1)
- 收藏
- 关注
RSS订阅转载 图的割点、桥与双连通分支
在一个无向连通图中，如果有一个顶点集合，删除这个顶点集合，以及这个集合中所有顶点相关联的边以后，原图变成多个连通块，就称这个点集为割点集合。一个图的点连通度的定义为，最小割点集合中的顶点数。类似的，如果有一个边集合，删除这个边集合以后，原图变成多个连通块，就称这个点集为割边集合。一个图的边连通度的定义为，最小割边集合中的边数。[双连通图、割点与桥]如果一个无向连通图的点连通度大于1，则
2015-01-27 01:51:24
699
转载 tarjan——有向图强连通分量
在有向图G中，如果两个顶点间至少存在一条路径，称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。非强连通图有向图的极大强连通子图，称为强连通分量(strongly connected components)。下图中，子图{1,2,3,4}为一个强连通分量，因为顶点1,2,3,4两两可达。{5},{6}也分别是两个强连通分量。
2015-01-27 01:20:16
751
原创 hdu4620Fruit Ninja Extreme
Fruit Ninja ExtremeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1177 Accepted Submission(s): 321Special JudgeProblem Description
2015-01-26 23:20:20
917
原创 hdu4614 Vases and Flowers
Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2148 Accepted Submission(s): 836Problem Description Alice is so
2015-01-25 23:57:40
825
原创 hdu4616 Game
GameTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1734 Accepted Submission(s): 552Problem Description Nowadays, there are more
2015-01-25 01:13:09
1586
原创 Codeforces Round #287 (Div. 2) C. Guess Your Way Out!
C. Guess Your Way Out!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr bought a new video game "Guess Your Way Out
2015-01-25 01:00:08
1474
原创 Codeforces Round #233 (Div. 1) A. Cards
A. Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputUser ainta loves to play with cards. He has a cards containin
2015-01-21 19:52:57
1159
原创 Codeforces Round #284 (Div. 2) C. Crazy Town
C. Crazy Towntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCrazy Town is a plane on which there are n infinite line
2015-01-21 12:11:56
1044
原创 Good Bye 2014 D. New Year Santa Network
D. New Year Santa Networktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNew Year is coming in Tree World! In this w
2015-01-20 20:34:24
920
原创 Good Bye 2014 B. New Year Permutation
B. New Year Permutationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputUser ainta has a permutation p1, p2, ..., pn.
2015-01-20 15:48:58
890
原创 Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter
C. Mr. Kitayuta, the Treasure Huntertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Shuseki Islands are an archip
2015-01-19 18:29:54
1274
原创 康托 Codeforces Round #285 (Div. 2) D. Misha and Permutations Summation
然后Rank和为(p1[i]+p2[i])*(n-1)! + ... + (p1[n]+p2[n])*0! = p3[1]*(n-1)! + ... + p3[n]*0! ，但是得出的表达式可能不是规整的形式，这是我们需要检测一边，从后往前扫，如果p3[i] >= (n-i+1), 说明第 i 项已经超过 (n-i+1)*(n-i), 那么就应进位到(n-i+1)!, 即p3[i-1]+=1，
2015-01-18 00:40:03
848
原创 Codeforces Round #285 (Div. 2)C. Misha and Forest
C. Misha and Foresttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a forest as a non-directed acyclic gr
2015-01-15 20:12:08
948
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人