图论
u010660276
这个作者很懒,什么都没留下…
展开
-
图的最大独立集poj1419
点独立集:设无向图G=,顶点集合V'是V的子集,若V'中的任意两个顶点都不相邻,则称V'为G的点独立集 这题求的是最大独立集 当然,这题可以看做是图上色问题,直接爆搜 还有一个定理是最大独立集=补图的最大团 最大团=补图的最大独立集原创 2014-07-01 09:20:08 · 635 阅读 · 0 评论 -
竞赛图找哈密尔顿回路(hdu3414)
下面内容转自http://blog.sina.com.cn/s/blog_8d84b9240101fdwj.html: 对于一个图中是否存在一条哈密顿路,没有可靠的充分必要条件(貌似邻接矩阵恒式可以?),因此求哈密顿路是一个NP问题,一般要使用搜索和状压dp求解,但汉密尔顿回路的存在有许多充分条件,即当图满足某些特定性质的时候,汉密尔顿回路一定存在,而且可以根据一些算法构造出来。原创 2015-04-05 21:11:44 · 4872 阅读 · 0 评论 -
树的直径hdu3721
Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Statistical Charts Problem Archive Realtime Judge Statu原创 2014-08-13 20:20:03 · 1073 阅读 · 0 评论 -
树的直径 Codeforces Round #260 (Div. 2)E
E. Civilization time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Andrew plays a game called "Civilization". Dima helps原创 2014-08-14 20:55:14 · 548 阅读 · 0 评论 -
最小生成树+LCA+uva11354
B NEXT Generation Contest 4 Time Limit – 8 secs Bond Once again, James Bond is on his way tosaving the world. Bond's latest mission requires him to travel between seve原创 2014-08-13 16:49:07 · 903 阅读 · 0 评论 -
LCA离线+在线+hdu2586(模板)
Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Statistical Charts Problem Archive Realtime Judge Statu原创 2014-08-09 11:16:17 · 605 阅读 · 0 评论 -
LCA+poj1986
Language: Default Distance Queries Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 9081 Accepted: 3178 Case Time Limit: 1000MS Description Farme原创 2014-08-09 21:03:14 · 684 阅读 · 0 评论 -
LCA(2009多校联合)hdu2874
Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Statistical Charts Problem Archive Realtime Judge Statu原创 2014-08-09 22:39:24 · 543 阅读 · 0 评论 -
LCA+poj1470
Language: Default Closest Common Ancestors Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 15187 Accepted: 4844 Description Write a program that take原创 2014-08-05 22:06:53 · 504 阅读 · 0 评论 -
LCA离线算法tarjan
LCA算法: LCA(Least Common Ancestor),顾名思义,是指在一棵树中,距离两个点最近的两者的公共节点。也就是说,在两个点通往根的道路上,肯定会有公共的节点,我们就是要求找到公共的节点中,深度尽量深的点。还可以表示成另一种说法,就是如果把树看成是一个图,这找到这两个点中的最短距离。 LCA算法有在线算法也有离线算法,所谓的在线算法就是实时性的,比方说,原创 2014-08-05 21:20:30 · 458 阅读 · 0 评论 -
二分图+hdu3729
#include #include #include using namespace std; #define debug(a) printf("debug : %d ***\n", a); #define INF 0x3f3f3f3f int n; int mi, ma; bool w[65][100000+5]; bool vis[100000+5]; int col[100000+原创 2014-08-08 18:02:54 · 445 阅读 · 0 评论 -
hash+状态压缩+uva10944
思路:用二进制表示当前果子被摘去的情况,进行BFS,hash表示这种状态是否出现过原创 2014-06-30 15:56:42 · 684 阅读 · 0 评论 -
2010 Asia Regional Tianjin Site —— Online Contest (线段树二维转一维,2-SAT,floyed变形)hdu3621-3631
Bomb GameProblem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each round, the computer will give Ro原创 2015-09-07 21:50:15 · 986 阅读 · 0 评论