POJ
文章平均质量分 79
--Splay--
这个作者很懒,什么都没留下…
展开
-
poj 2236 Wireless Network 并查集
Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 18869 Accepted: 7938DescriptionAn earthquake takes place in Southeast Asia. The ACM (原创 2015-07-25 09:49:54 · 330 阅读 · 0 评论 -
poj 1011 Sticks 经典dfs+剪枝
DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many stick原创 2015-07-22 13:21:48 · 523 阅读 · 0 评论 -
总结POJ
到现在还是没弄清楚oj中g++与c++有何区别。。。不过通常c++都是可以过的,g++毛病就多了。对于poj中,要注意的就是1. 输入,对于long long int 输入要用%I64d2. double型输出要用,%f,用%lf,就会wa。。。3. 要用到随机数时,比如模拟退火,srand(time(NULL))就不能用。。。否则就会re。。这个真是日了狗了。。第一次调了一下午才原创 2015-07-22 13:47:37 · 433 阅读 · 0 评论 -
poj 1679 The Unique MST - 次小生成树
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23309 Accepted: 8268DescriptionGiven a connected undirected graph, tell if its minimum s原创 2015-07-25 07:57:25 · 549 阅读 · 0 评论 -
poj 1258 Agri-Net 最小生成树
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 44617 Accepted: 18242DescriptionFarmer John has been elected mayor of his town! One of his cam原创 2015-07-25 08:02:35 · 368 阅读 · 0 评论 -
poj 3026 Borg Maze 最小生成树
Borg MazeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9954 Accepted: 3341DescriptionThe Borg is an immensely powerful race of enhanced humanoids fr原创 2015-07-25 08:12:11 · 399 阅读 · 0 评论 -
poj 1611 The Suspects 并查集
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 26537 Accepted: 12972DescriptionSevere acute respiratory syndrome (SARS), an atypical pneu原创 2015-07-25 08:20:30 · 362 阅读 · 0 评论 -
poj 1182 食物链 并查集扩展--带权并查集
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 52210 Accepted: 15277Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动原创 2015-07-25 09:24:56 · 400 阅读 · 0 评论 -
poj 2492 A Bug's Life 带权并查集
A Bug's LifeTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 30837 Accepted: 10090DescriptionBackground Professor Hopper is researching the sexual b原创 2015-07-25 09:37:25 · 466 阅读 · 0 评论 -
poj 2152 Fire - 经典树形dp
题目链接: http://poj.org/problem?id=2152不多说。。 2006 陈启峰消防站解题报告这dp简直是神了。。#include #include #include #include #include #include #include #include #include #include #include #includ原创 2015-10-10 09:48:19 · 575 阅读 · 0 评论 -
poj 1741 - Tree 树分治
题目链接: http://poj.org/problem?id=1741题意:给一棵树,树上每条边都有权值,问你树上两个点之间的距离不超过K的点对有多少个。思路:看2009年国家集训队 漆子超 的论文 >。文中已经把大概的解题思路都将清楚了,但是作为第一次写树分治的我来说依旧是茫然一片。。。于是只能依靠网上的大牛了。。这题融汇了很多的思想,细细品味后感觉收货还是挺大的。原创 2015-10-10 15:02:10 · 576 阅读 · 0 评论 -
poj 3083 Children of the Candy Corn dfs+bfs
DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors原创 2015-07-22 12:05:31 · 415 阅读 · 0 评论 -
poj 2420 A Star not a Tree? -- 模拟退火
A Star not a Tree?Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4377 Accepted: 2164DescriptionLuke wants to upgrade his home computer network from 1原创 2015-07-22 10:15:28 · 536 阅读 · 0 评论 -
poj 2299 Ultra-QuickSort 二分+线段树求逆序数
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 47564 Accepted: 17354DescriptionIn this problem, you have to analyze a particular sorti原创 2015-07-22 11:21:18 · 501 阅读 · 0 评论 -
The Geodetic Set Problem - POJ 1612 Floyd求最短路径所有点集
题目链接 POJ 1612DescriptionLet G = (V,E) be a connected graph without loops and multiple edges, where V and E are the vertex and edge, respectively, sets of G. For any two vertices u, v ∈ V ,the di原创 2015-07-05 19:41:39 · 841 阅读 · 0 评论 -
Pie - POJ 3122 二分
DescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my par原创 2015-07-05 20:32:23 · 481 阅读 · 0 评论 -
Showstopper - POJ 3484 二分
DescriptionData-mining huge data sets can be a painful and long lasting process if we are not aware of tiny patterns existing within those data sets.One reputable company has recently discovered原创 2015-07-05 21:38:26 · 580 阅读 · 0 评论 -
poj 2104 K-th Number - 经典划分树
DescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able原创 2015-07-08 18:40:05 · 1194 阅读 · 1 评论 -
poj 1379 Run Away 模拟退火
Run AwayTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 7520 Accepted: 2280DescriptionOne of the traps we will encounter in the Pyramid is located in原创 2015-07-22 10:29:01 · 556 阅读 · 0 评论 -
poj 3258 River Hopscotch 二分搜索
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8867 Accepted: 3815DescriptionEvery year the cows hold an event featuring a peculiar ve原创 2015-07-22 11:09:49 · 424 阅读 · 0 评论 -
poj 3087 Shuffle'm Up 模拟
Shuffle'm UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7341 Accepted: 3396DescriptionA common pastime for poker players at a poker table is to sh原创 2015-07-22 11:52:14 · 450 阅读 · 0 评论 -
poj 3984 迷宫问题 bfs输出路径
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10850 Accepted: 6473Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,原创 2015-07-22 11:43:19 · 564 阅读 · 0 评论 -
poj 2251 Dungeon Master 三维bfs
DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit原创 2015-07-22 12:00:26 · 512 阅读 · 0 评论 -
poj 3301 Texas Trip 三分搜索
Texas TripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4459 Accepted: 1375DescriptionAfter a day trip with his friend Dick, Harry noticed a strange原创 2015-07-22 10:58:40 · 602 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers - Splay
题目链接: http://poj.org/problem?id=3468题意:区间更新,求区间和。本来是线段树区间更新的入门题,一直听说Splay这个神奇的数据结构没去学,于是就学了一下,第一道。。推荐学习:http://notonlysuccess.me/?p=709http://blog.csdn.net/acm_cxlove/article/details/7原创 2015-12-08 19:49:20 · 439 阅读 · 0 评论