贪心
文章平均质量分 77
云淡风轻jzl
一路脚踏实地,不忘仰望星空。
展开
-
CodeForces-1196F-K-th Path-贪心建图
http://codeforces.com/problemset/problem/1196/F题目描述:You are given a connected undirected weighted graph consisting of n vertices and m edges.You need to print the k-th smallest shortest path in this graph (paths from the vertex to itself are not counted原创 2021-04-28 18:35:45 · 264 阅读 · 0 评论 -
Codeforces-The Sports Festival-贪心+dp
题目描述:The student council is preparing for the relay race at the sports festival.The council consists of n members. They will run one after the other in the race, the speed of member i is si. The discrepancy di of the i-th stage is the difference between原创 2021-04-19 11:29:59 · 329 阅读 · 0 评论 -
2021年北京理工大学ACM CLUB清明节组队训练赛-Generator Grid-并查集+贪心
题目描述:The volcanic island of Fleeland has never had a proper electric net, but finally the Biomass Alternative Power Conglomerate (BAPC) has agreed to build the island’s power plants and network.On the island’s coast are its n cities. The BAPC has surveye原创 2021-04-04 17:41:46 · 314 阅读 · 0 评论 -
QDUOJ计科寒假测试赛01-LB竟然当众开车!-贪心求最长下降子序列
题目描述:LB有n列火车。火车按照序号从1~n排列在入口轨道上(1号火车在最前方,即下图入口最右方),火车的行进方向都是从左至右。有钱的LB想在入口与出口之间修建k条中部轨道,火车可从入口轨道进入任意一条中部轨道,最后都从出口轨道驶出。LB想让火车按照价格递增的顺序驶出,便找到JZL,问至少要修建多少条中部轨道,可是JZL天生愚钝,你能帮他解决这个问题吗?注:下图中的数字是价格而不是序号。输入描述:第一行输入一个整数n,表示火车的数量。接下来n行,每行一个整数,第i+1行表示第i列火车的价原创 2021-01-20 17:22:47 · 165 阅读 · 1 评论 -
牛客3007C-汉诺塔-最长下降子序列+贪心模拟
链接:https://ac.nowcoder.com/acm/contest/3007/C来源:牛客网题目描述:现在你有 N 块矩形木板,第 i 块木板的尺寸是 Xi*Yi,你想用这些木板来玩汉诺塔的游戏。我们知道玩汉诺塔游戏需要把若干木板按照上小下大的顺序堆叠在一起,但因为木板是矩形,所以有一个问题:第 i 块木板能放在第 j 块木板上方当且仅当 Xi<Xj 且 Yi<Yj...原创 2020-02-15 20:12:32 · 334 阅读 · 0 评论 -
CF 1253D-Harmonious Graph-并查集+贪心
DescriptionYou’re given an undirected graph with n nodes and m edges. Nodes are numbered from 1 to n.The graph is considered harmonious if and only if the following property holds:For every triple...原创 2019-11-21 11:28:04 · 375 阅读 · 0 评论 -
HDU 1160-FatMouse's Speed-最长下降子序列-两种求法
FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequence...原创 2019-07-26 11:27:40 · 158 阅读 · 0 评论