数据结构算法
文章平均质量分 84
数据结构相关算法
CXY_Likescoding
不失情怀,不忘初心!
展开
-
POJ—Feel Good(前缀和+单调栈)
题目链接:Feel GoodDescriptionBill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people’s memories about some period of life.A new idea Bill has recently develope原创 2021-03-25 15:20:47 · 189 阅读 · 0 评论 -
HDU 4911 Inversion(树状数组求逆序对数 + 数据离散化)
Problem Descriptionbobo has a sequence a1,a2,…,an. He is allowed to swap twoadjacent numbers for no more than k times.Find the minimum number of inversions after his swaps.Note: The numb原创 2017-08-17 15:05:53 · 360 阅读 · 0 评论 -
HDU 2795 Billboard(线段树区间最值查询和单点更新)
Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements原创 2017-05-13 21:08:31 · 339 阅读 · 0 评论 -
HDU 1698 Just a Hook(线段树 区间更新 + 查询区间和)
Problem DescriptionIn 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原创 2017-05-13 21:05:08 · 258 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers(线段树+lazy优化)
DescriptionYou have N integers, A1, A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is原创 2017-05-13 20:47:52 · 227 阅读 · 0 评论 -
HDU 1754 I Hate It(线段树+区间最值)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。Input本题目包含多组测试,请处理到文件结束。在每个测试的第一行,有两个正整数 N 和 M ( 0原创 2017-04-20 08:32:21 · 235 阅读 · 0 评论 -
HDU 1541 Stars(树状数组/线段树)
Problem DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars tha...原创 2016-08-12 16:52:40 · 397 阅读 · 0 评论 -
HDU 1394 Minimum Inversion Number(树状数组+逆序数)
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17988Accepted Submission(s): 10927Problem DescriptionThe原创 2016-08-12 16:44:12 · 330 阅读 · 0 评论 -
HDU 1166 敌兵布阵(树状数组 区间和)
C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。 中央情报局要...原创 2016-08-12 16:39:58 · 325 阅读 · 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): 17048Accepted Submission(s): 8515Problem DescriptionN个气球排成一排,从左到右依原创 2016-08-10 20:21:53 · 250 阅读 · 0 评论 -
Leetcode 685. 冗余连接 II(拓扑排序+并查集)
[题目链接]思路:\qquad根据题意,题目中的有向图为一棵树加上一条冗余边。一棵树的所有子节点入度均为1,根节点入度为0,因此可以分为以下两种情况:\qquad (1)图中存在入度为2的节点。因为根节点的入度为0,添加一条边,入度最多加1,因此入度为2的点一定是子节点,要删除的边一定是连向这个节点的边之一,根是入度为0的节点。此时考虑删掉每条连向该节点的边,对剩下的图从根节点拓扑排序,若没有环且能遍历到所有点,则枚举的边就是答案;\qquad(2)图中点的入度均为1,即从子节点向根节点连一条边。此原创 2020-09-19 13:23:16 · 170 阅读 · 0 评论 -
POJ 1182 食物链(并查集 带权路径)
自己太菜,这里转载一篇神牛的博客,结实得很详细!转载 2017-08-24 16:20:09 · 285 阅读 · 0 评论 -
HDU 3038 How Many Answers Are Wrong(并查集)
Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To be...原创 2016-08-09 17:07:39 · 541 阅读 · 0 评论 -
HDU 4496 D-City(并查集)
Problem DescriptionLuxer is a really bad guy. He destroys everything he met.One day Luxer went to D-city. D-city has N D-points and M D-lines. Each D-line connects exactly two D-points. Luxer will ...原创 2016-08-09 22:44:30 · 364 阅读 · 0 评论