树
夜幕下的ACM之路
通往成功的路注定是孤独的,我不会放弃!!!!
展开
-
HDU 1325 Is It A Tree?(并查集或者树)
本题跟小希的迷宫基本完全一样。。所以在这里就写了一个树的代码来过这个题目,下面是AC代码#include<iostream>#include<cstdio>#include<cstring>using namespace std;int f[100005];int main(){ int a,b,flag,i,j; int t=1; while(1) {原创 2016-03-03 14:59:29 · 347 阅读 · 0 评论 -
FZU 2171 防守阵地 II(线段树区间更新【lazy标记】)
Problem Description部队中总共有N个士兵,每个士兵有各自的能力指数Xi,在一次演练中,指挥部确定了M个需要防守的地点,指挥部将选择M个士兵依次进入指定地点进行防守任务,获得的参考指数即为M个士兵的能力之和。随着时间的推移,指挥部将下达Q个指令来替换M个进行防守的士兵们,每个参加完防守任务的士兵由于疲惫等原因能力指数将下降1。现在士兵们排成一排,请你计算出每次进行防守的士兵的参考指数原创 2016-04-19 21:21:01 · 349 阅读 · 0 评论 -
哈理工OJ 1189 区间最大值 II(线段树【简单】)
区间最大值 II Time Limit: 1000 MS Memory Limit: 65535 K Total Submit: 485(160 users) Total Accepted: 175(115 users) Rating: Special Judge: No Description 给一个有n个整数的序列a1, a2, a3, …, an,然后有q个提问,每个提原创 2016-04-19 22:18:28 · 490 阅读 · 0 评论 -
POJ 1258 Agri-Net(最小生成树)
Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 49376 Accepted: 20506 DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to b原创 2016-05-05 14:30:05 · 475 阅读 · 0 评论 -
POJ 1751 Highways(最小生成树+剪枝)
Highways Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12364 Accepted: 3568 Special Judge DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Fla原创 2016-05-05 17:32:20 · 793 阅读 · 0 评论 -
HDU 1556 Color the ball(线段树的区间更新【注释】)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15092 Accepted Submission(s): 7514Problem Description N个气球排成一排,从左到右依次编号为1,2,3原创 2016-04-12 16:09:33 · 424 阅读 · 0 评论 -
HDU 1247 Hat’s Words(字典树)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1247Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13822 Accepted Submission(s):原创 2016-11-07 19:36:16 · 284 阅读 · 0 评论 -
POJ 2001 Shortest Prefixes(字典树)
题目链接:http://poj.org/problem?id=2001Shortest Prefixes Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 17746 Accepted: 7718 DescriptionA prefix of a string is a substring starti原创 2016-11-07 19:41:53 · 418 阅读 · 0 评论 -
HDU 1251 统计难题(字典树)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1251统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 35696 Accepted Submission(s): 13345P原创 2016-11-07 19:51:34 · 291 阅读 · 0 评论 -
HDU 5927 Auxiliary Set【DFS】(2016CCPC东北赛F题)
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=5927【中文题意】一棵节点数为n的有根数,根节点为1,一开始所有的点都是重点,接下来有q次询问,每次询问把m个点变为轻点,问你树中还有多少个重点。 重点应该满足的条件为: 1.它本身是重点。 2.它为两个重点的最近公共祖先。 每次询问之后在下次询问前,所有的点都恢复为重点。 【思路分原创 2017-05-03 20:49:39 · 393 阅读 · 0 评论 -
UVA 11020 Efficient Solutions (用multiset实现BST)
题目链接:https://cn.vjudge.net/problem/UVA-11020“Our marriage ceremonies are solemn, sober moments of reflection; also regret, disagreement, argument and mutual recrimination. Once you know it can’t get原创 2017-08-07 19:23:56 · 282 阅读 · 0 评论 -
ZOJ 1586 QS Network(最小生成树)
Sunny Cup 2003 - Preliminary RoundApril 20th, 12:00 - 17:00Problem E: QS NetworkIn the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicate with each other via ne原创 2016-05-01 13:36:28 · 1186 阅读 · 0 评论 -
HDU 1875 畅通工程再续(最小生成树)
畅通工程再续Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 22821 Accepted Submission(s): 7288Problem Description 相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的原创 2016-05-01 13:29:09 · 295 阅读 · 0 评论 -
FZU 2195 检查站点(并查集或者树)
Problem Description在山上一共有N个站点需要检查,检查员从山顶出发去各个站点进行检查,各个站点间有且仅有一条通路,检查员下山前往站点时比较轻松,而上山时却需要额外的时间,问最后检查员检查完所有站点时所需要的额外时间最少是多少。Input包含多组数据 每组数据输入第一行为一个整数N 表示站点个数(1<=N<=100000),接下去N-1 行 每行3个整数 x,y,z(1<=z<=10原创 2016-03-06 18:41:45 · 466 阅读 · 0 评论 -
HDU 1698 Just a Hook(线段树的区间更新)
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.Now Pudge want原创 2016-04-03 22:23:26 · 363 阅读 · 0 评论 -
HDU I Hate It(线段树单点更新,最值查找)
Problem Description 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。Input 本题目包含多组测试,请处理到文件结束。 在每个测试的第一行,有两个正整数 N 和 M ( 0#include<cst原创 2016-04-03 23:58:59 · 405 阅读 · 0 评论 -
HDU--1166敌兵布阵(线段树)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 68422 Accepted Submission(s): 28762Problem Description C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Der原创 2016-03-29 12:51:52 · 420 阅读 · 0 评论 -
HDU 2122 Ice_cream’s world III(最小生成树Kruskal)
Problem Description ice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beautif原创 2016-04-15 07:33:56 · 412 阅读 · 0 评论 -
POJ 1287 Networking(最小生成树)
DescriptionYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect原创 2016-04-28 21:06:05 · 371 阅读 · 0 评论 -
POJ 1251 Jungle Roads(最小生成树【简单】)
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so原创 2016-04-28 21:31:05 · 645 阅读 · 0 评论 -
POJ 1679 The Unique MST(次小生成树)
DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a su原创 2016-04-29 21:21:23 · 313 阅读 · 0 评论 -
POJ 2421 Constructing Roads(最小生成树简单题目)
Constructing Roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 21881 Accepted: 9295 DescriptionThere are N villages, which are numbered from 1 to N, and you should build s原创 2016-05-01 09:52:47 · 915 阅读 · 0 评论 -
POJ 2031 Building a Space Station(最小生成树)
Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 6861 Accepted: 3343 DescriptionYou are a member of the space station engineering team, and are assigned a原创 2016-05-01 10:53:02 · 329 阅读 · 0 评论 -
hihocoder 1567 偶树的切分(树的深搜)
题目链接:http://hihocoder.com/problemset/problem/1567【中文题意】1567 : 偶树的切分时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 如果一棵树节点数目是偶数,那么就称这棵树是偶树。给定一棵N个节点的偶树(编号1~N),小Hi想知道他最多可以同时切断多少条边,使得剩下的森林中每一个联通分量都是一棵偶树。例如如下的偶原创 2017-09-06 20:07:41 · 402 阅读 · 0 评论