poj
Puppet__
努力想变得更好
展开
-
Poj 2139 Six Degrees of Cowvin Bacon (floyd最短路)
Six Degrees of Cowvin Bacon Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3993Description The cows have been making movies lately, so they are ready原创 2017-07-26 15:03:01 · 454 阅读 · 0 评论 -
POJ 1260 简单dp问题 Pearls
PearlsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9680 Accepted: 4946DescriptionIn Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot o原创 2017-12-05 15:50:03 · 254 阅读 · 0 评论 -
树状数组 区间更新(利用了伪线段树) + poj3468题解
废话不多说 先粘代码 以poj3468为例A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 123915 Accepted: 38431Case Time Limit: 2000MSDescriptionYou have N integers,原创 2018-01-18 17:39:26 · 423 阅读 · 0 评论 -
(POJ 1258)Prim算法 最小生成树
Prime 只于顶点有关 基本思想1.清空生成树,任取一个顶点加入生成树2.在那些一个端点在生成树里,另一个端点不在生成树里的边中,选取一条权最小的边,将它和另一个端点加进生成树3.重复步骤2,直到所有的顶点都进入了生成树为止,此时的生成树就是最小生成树Description Farmer John has been elected mayor of his town! One of his c原创 2017-07-22 16:43:11 · 1460 阅读 · 2 评论 -
(poj 2377)Kruskal算法 最大生成树
这道题只是一道模板题,感到唯一的坑点就是n,m容易打错,一定要注意结构体要开到Max(M)+n; 之前便是因为这个地方Runtime Error了两次;顺便注意最后输出的答案 为long long型题目**Description Bessie has been hired to build a cheap internet network among Farmer John’s N (2 <= N原创 2017-07-22 16:07:31 · 7818 阅读 · 0 评论