贪心
文章平均质量分 59
tomjobs
别慌,慌也没用
展开
-
LeetCode 765. 情侣牵手(并查集/贪心)
思路:(完全是被题目名字吸引)每个人编号为row[i]row[i]row[i],那么其对应组号就为row[i]/2row[i]/2row[i]/2,这保证x,x⊕1x,x⊕1x,x⊕1在同一组。然后我们将相邻两个位置数对应组号连边,也就是row[i]−>row[i+1],i为奇数row[i]->row[i+1],i为奇数row[i]−>row[i+1],i为奇数,用并查集维护。这样的话得出一个kkk元环就只需要k−1k-1k−1次操作,那么只需要看并查集最后形成几个连通块就好了。.原创 2021-02-24 13:17:19 · 226 阅读 · 0 评论 -
LeetCode 1675. 数组的最小偏移量(堆+贪心)
给你一个由 n 个正整数组成的数组 nums 。你可以对数组的任意元素执行任意次数的两类操作:如果元素是 偶数 ,除以 2例如,如果数组是 [1,2,3,4] ,那么你可以对最后一个元素执行此操作,使其变成 [1,2,3,2]如果元素是 奇数 ,乘上 2例如,如果数组是 [1,2,3,4] ,那么你可以对第一个元素执行此操作,使其变成 [2,2,3,4]数组的 偏移量 是数组中任意两个元素之间的 最大差值 。返回数组在执行某些操作之后可以拥有的 最小偏移量 。示例 1:输入:nums =原创 2021-02-01 16:02:29 · 750 阅读 · 1 评论 -
Codeforces-1473 F. Strange Housing(贪心,染色)
Students of Winter Informatics School are going to live in a set of houses connected by underground passages. Teachers are also going to live in some of these houses, but they can not be accommodated randomly. For safety reasons, the following must hold:A原创 2021-01-17 18:09:17 · 333 阅读 · 1 评论 -
Codeforces1457 E. New Game Plus!(贪心)
Wabbit is playing a game with ???? bosses numbered from 1 to ????. The bosses can be fought in any order. Each boss needs to be defeated exactly once. There is a parameter called boss bonus which is initially 0.When the ????-th boss is defeated, the curre原创 2020-11-29 21:38:50 · 529 阅读 · 0 评论 -
Codeforces 1452E. Two Editorials(排序,贪心)
Berland regional ICPC contest has just ended. There were ???? participants numbered from 1 to ????, who competed on a problemset of ???? problems numbered from 1 to ????.Now the editorial is about to take place. There are two problem authors, each of them原创 2020-11-21 18:50:20 · 252 阅读 · 0 评论 -
GYM M - TFF Gym - 101864M(贪心)
题意:H(x)=F(x)∗G(x)H(x)=F(x)*G(x)H(x)=F(x)∗G(x)给你H(x)H(x)H(x)和G(x)G(x)G(x),求F(x)F(x)F(x)。思路:从F(x)F(x)F(x)的最高位开始确定,确定完最高位,就消除掉这个最高位对于H(x)H(x)H(x)的影响,于是下一位就成了最高位。#include <bits/stdc++.h>using namespace std;const int maxn = 2005+10;typedef long lo原创 2020-11-19 14:56:56 · 103 阅读 · 0 评论 -
2020ICPC·小米 网络选拔赛第二场 Subsequence Pair(贪心二分)
题意:一个只含有0,1,2的序列,要求选出最多的2,0,2,0子序列,且子序列之间没有交集。思路:二分选了mid个2020,然后从前往后找mid个20序列,再从后往前找出剩余所有的20序列。前面部分的20序列优先按照0的坐标(右端点)排序,后面部分的20序列优先按照2的坐标(左端点排序),然后两者匹配看能否满足要求。#include <cstdio>#include <cstring>#include <algorithm>#include <qu.原创 2020-10-31 21:59:23 · 1119 阅读 · 0 评论 -
2020秦皇岛CCPC 7-11 Kingdom‘s Power(贪心,树)
题意:每次可以从根节点派出一个军队,或者让已有军队走一格。求覆盖所有点的最少时间。思路:题目可以转换为覆盖所有叶子,最后所有的军队都会停留在叶子上。覆盖一个叶子,要么是从根节点派一个军队出来,要么是之前一个叶子的军队派过来。所以对于每个叶子,我们只需要维护两个东西,一个是其深度——根节点派军队的花费;一个是之前某个有军队叶子到当前叶子的最小距离。我们肯定不能对于之前所有叶子都判断一遍,所以我们需要找到一个合理的遍历顺序,使得只可能存在上一个叶子到当前叶子,或者根节点到当前叶子的情况。一个直观原创 2020-10-22 10:52:39 · 504 阅读 · 0 评论 -
Installing Apps Gym - 101623I(背包+贪心)
题意:下载app,每个app有下载容量和安装容量。内存必须满足下载容量才能下载,最后所占空间为安装容量。求c的内存最多可以安装多少个app。思路:比赛的时候wzf猜了个结论,就是按照 d-s排序从大到小遍历,然后按照普通背包跑然后过了。事后想想的话,其实可以从背包转移方程看出来:dp[j−num+a[i].s]=max(dp[j−num+a[i].s],dp[j−num]+1),num=max(a[i].s,a[i].d),num≤j≤cdp[j - num + a[i].s] =max(dp[原创 2020-10-10 00:09:02 · 341 阅读 · 0 评论 -
F - Factor-Free Tree Gym - 101623F(质数,中序遍历,区间)
题意:给出一颗树的中序遍历,要求还原这棵树使得每一个节点的值和其祖先互质思路:参考claris博客题解。对每个数质因子分解,算出每个数左边的第一个不互质位置,右边第一个不互质位置。维护每个点对应的区间,也就是其对应子树。将这些区间放在栈里面,如果当前区间包含栈顶区间,那么弹出栈顶。则按照中序遍历左中右的顺序,最后一个弹出的区间为当前点的左子树,当前栈顶区间为节点父子节点。则无解情况为栈顶区间不包含当前区间,此时父节点不能包括子节点。#include <cstdio>#inc.原创 2020-10-09 22:17:33 · 309 阅读 · 0 评论 -
Codeforces Global Round 10 F. Omkar and Landslide(贪心)
Omkar is standing at the foot of Celeste mountain. The summit is ???? meters away from him, and he can see all of the mountains up to the summit, so for all 1≤????≤???? he knows that the height of the mountain at the point ???? meters away from himself is原创 2020-09-21 19:49:31 · 182 阅读 · 0 评论 -
Codeforces962E. Byteland, Berland and Disputed Cities(贪心)
The cities of Byteland and Berland are located on the axis ????????. In addition, on this axis there are also disputed cities, which belong to each of the countries in their opinion. Thus, on the line ???????? there are three types of cities:the cities of原创 2020-09-03 10:31:57 · 293 阅读 · 0 评论 -
Codeforces1395 D. Boboniu Chats with Du(贪心)
Have you ever used the chat application QQ? Well, in a chat group of QQ, administrators can muzzle a user for days.In Boboniu’s chat group, there’s a person called Du Yi who likes to make fun of Boboniu every day.Du will chat in the group for ???? days.原创 2020-08-13 11:56:38 · 1213 阅读 · 0 评论 -
牛客多校第八场 Kabaleo Lite(贪心)
题意:有n种菜,每种菜m个,每种菜有一个利润。你可以选前x种菜,每种菜上一个给一个人。求最多服务多少人,然后最大利润是多少。思路:因为先要满足最大人数,所以人数结果就是b[1]b[1]b[1]。可以发现,b[i]=min(b[i−1],b[i])b[i]=min(b[i-1],b[i])b[i]=min(b[i−1],b[i]),因为要是后面的菜品比前面大,那么多的部分是上不了的。给菜的利润维护一个前缀值,每次肯定是选择最大的前缀值,维护dp[i]dp[i]dp[i]代表前iii个数的最大前缀原创 2020-08-04 00:30:25 · 238 阅读 · 0 评论 -
2020杭电多校第三场 Parentheses Matching(括号匹配,贪心)
Problem DescriptionThere are n members in our ACM club. Little W wants to select three persons from our club to form a new team taking part in provincial ACM contests, as it is known by all of us that any ACM contest requires a normal team to have three m原创 2020-07-29 15:09:48 · 391 阅读 · 0 评论 -
2020杭电多校第三场 Tokitsukaze and Multiple(map贪心,DP)
Problem DescriptionTokitsukaze has a sequence of length n, denoted by a.Tokitsukaze can merge two consecutive elements of a as many times as she wants. After each operation, a new element that equals to the sum of the two old elements will replace them,原创 2020-07-29 15:01:20 · 511 阅读 · 0 评论 -
牛客多校第六场 K-Bag(暴力,贪心)
题意:原序列是一堆k个数全排列组成的。给你一个串,求这个子串是否可能是原序列子串思路:直接暴力啊,维护出dp[i]dp[i]dp[i]代表iii~i+k−1i+k-1i+k−1是否是全排列,然后枚举第一个排列的终止位置。枚举起始排列的复杂度为kkk,check的复杂度为n/kn/kn/k,所以就是O(n)的。#include <cstdio>#include <cstring>#include <algorithm>#include <queue&g.原创 2020-07-28 20:09:18 · 231 阅读 · 0 评论 -
杭电多校第一场 HDU6759 Leading Robots(优先队列贪心)
Problem DescriptionSandy likes to play with robots. He is going to organize a running competition between his robots. And he is going to give some presents to the winners. Robots are arranged in a line. They have their initial position (distance from the原创 2020-07-22 16:07:53 · 330 阅读 · 0 评论 -
Codeforces 1379 C. Choosing flowers(贪心)
Vladimir would like to prepare a present for his wife: they have an anniversary! He decided to buy her exactly ???? flowers.Vladimir went to a flower shop, and he was amazed to see that there are ???? types of flowers being sold there, and there is unlimi原创 2020-07-21 20:16:25 · 424 阅读 · 0 评论 -
ICPC Central Europe Regional Contest 2019 H. Ponk Warshall(贪心)
Listening to the rock music permutes your nuclear DNA. This astonishing and unbelievablefact was recently published in the Rock Nature Weekly, one of the top scientifific journals onthe planet. Part of the research was to take DNA samples from volunteers,原创 2020-06-21 20:59:03 · 596 阅读 · 0 评论 -
Daydreaming Stockbroker Gym - 101550D(贪心)
题意:相邻两天股价相同的情况无需考虑。不妨设相邻天股价不同。则每天都要卖出/买入。如果当天股价大于昨天,那就得卖出;如果当天股价小于昨天,那就得买入。如果卖出了,当前持有的就是钱;如果买入了,已知当前的钱和当天的股价就可以知道持有多少股票。所以前iii天最多有多少钱和第i−1i-1i−1的股票价格,就可以知道最多有多少股票。进而也可以确定今天可以买入多少和可以卖出多少#include <cstdio>#include <cstring>#include <ve.原创 2020-06-14 21:56:24 · 275 阅读 · 0 评论 -
Codeforces 1363E - Tree Shuffling(贪心)
Ashish has a tree consisting of ???? nodes numbered 1 to ???? rooted at node 1. The ????-th node in the tree has a cost ????????, and binary digit ???????? is written in it. He wants to have binary digit ???????? written in the ????-th node in the end.To原创 2020-06-01 17:16:58 · 342 阅读 · 0 评论 -
B - Alternative Bracket Notation Gym - 101002B(贪心+模拟)
题意:每个括号可以表示为 x,y:x,y:x,y:,xxx代表当前括号字符结束位置的下一个位置,yyy代表右括号位置结束字符的下一个位置。求一个最短的表示结果。思路:没什么思路的题目。正解是先假设每一个数字长度都是1,然后循环一遍再更新。更新几千次就可以了。#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <stack>.原创 2020-05-25 13:27:48 · 378 阅读 · 0 评论 -
ACWING115. 给树染色(贪心)
一颗树有 n 个节点,这些节点被标号为:1,2,3…n,每个节点 i 都有一个权值 A[i]。现在要把这棵树的节点全部染色,染色的规则是:根节点R可以随时被染色;对于其他节点,在被染色之前它的父亲节点必须已经染上了色。每次染色的代价为T*A[i],其中T代表当前是第几次染色。求把这棵树染色的最小总代价。输入格式第一行包含两个整数 n 和 R ,分别代表树的节点数以及根节点的序号。第二...原创 2020-02-26 21:25:31 · 295 阅读 · 0 评论 -
ACWING114. 国王游戏(贪心,Java)
恰逢 H 国国庆,国王邀请 n 位大臣来玩一个有奖游戏。首先,他让每个大臣在左、右手上面分别写下一个整数,国王自己也在左、右手上各写一个整数。然后,让这 n 位大臣排成一排,国王站在队伍的最前面。排好队后,所有的大臣都会获得国王奖赏的若干金币,每位大臣获得的金币数分别是:排在该大臣前面的所有人的左手上的数的乘积除以他自己右手上的数,然后向下取整得到的结果。国王不希望某一个大臣获得特别多的...原创 2020-02-26 15:18:49 · 519 阅读 · 0 评论 -
AcWing 112. 雷达设备(贪心 区间)
假设海岸是一条无限长的直线,陆地位于海岸的一侧,海洋位于另外一侧。每个小岛都位于海洋一侧的某个点上。雷达装置均位于海岸线上,且雷达的监测范围为d,当小岛与某雷达的距离不超过d时,该小岛可以被雷达覆盖。我们使用笛卡尔坐标系,定义海岸线为x轴,海的一侧在x轴上方,陆地一侧在x轴下方。现在给出每个小岛的具体坐标以及雷达的检测范围,请你求出能够使所有小岛都被雷达覆盖所需的最小雷达数目。输入格式...原创 2020-02-25 20:20:39 · 236 阅读 · 0 评论 -
ACWING111. 畜栏预定(贪心 区间)
有N头牛在畜栏中吃草。每个畜栏在同一时间段只能提供给一头牛吃草,所以可能会需要多个畜栏。给定N头牛和每头牛开始吃草的时间A以及结束吃草的时间B,每头牛在[A,B]这一时间段内都会一直吃草。当两头牛的吃草区间存在交集时(包括端点),这两头牛不能被安排在同一个畜栏吃草。求需要的最小畜栏数目和每头牛对应的畜栏方案。输入格式第1行:输入一个整数N。第2…N+1行:第i+1行输入第i头牛的开始...原创 2020-02-25 20:15:13 · 273 阅读 · 0 评论 -
ACWING110. 防晒(贪心 区间)
有C头奶牛进行日光浴,第i头奶牛需要minSPF[i]到maxSPF[i]单位强度之间的阳光。每头奶牛在日光浴前必须涂防晒霜,防晒霜有L种,涂上第i种之后,身体接收到的阳光强度就会稳定为SPF[i],第i种防晒霜有cover[i]瓶。求最多可以满足多少头奶牛进行日光浴。输入格式第一行输入整数C和L。接下来的C行,按次序每行输入一头牛的minSPF和maxSPF值,即第i行输入minSPF...原创 2020-02-25 20:08:51 · 456 阅读 · 0 评论 -
Mind Control CodeForces - 1291C(贪心)
You and your n−1 friends have found an array of integers a1,a2,…,an. You have decided to share it in the following way: All n of you stand in a line in a particular order. Each minute, the person at t...原创 2020-02-14 21:16:21 · 315 阅读 · 0 评论 -
Barbara Bennett's Wild Numbers POJ - 3340(贪心)
A wild number is a string containing digits and question marks (like 36?1?8). A number X matches a wild number W if they have the same length, and every non-question mark character in X is equal to th...原创 2020-01-20 18:18:56 · 277 阅读 · 0 评论 -
ECfinal 2019 E. Flow(贪心)
One of Pang’s research interests is the maximum flow problem.A directed graph ???? with ???? vertices is universe if the following condition is satisfied:???? is the union of ???? vertex-independent simple path...原创 2020-01-16 16:45:11 · 810 阅读 · 0 评论 -
CF1282 C. Petya and Exam(贪心)
Petya has come to the math exam and wants to solve as many problems as possible. He prepared and carefully studied the rules by which the exam passes.The exam consists of ???? problems that can be solve...原创 2019-12-25 22:28:35 · 545 阅读 · 0 评论 -
CF1269C. Long Beautiful Integer(贪心)
You are given an integer ???? of ???? digits ????1,????2,…,????????, which make up its decimal notation in order from left to right.Also, you are given a positive integer ????<????.Let’s call integer ????1,????2,…,???????? beautifu...原创 2019-12-24 01:28:42 · 409 阅读 · 0 评论 -
CF1269D. Domino for Young (贪心)
You are given a Young diagram.Given diagram is a histogram with ???? columns of lengths ????1,????2,…,???????? (????1≥????2≥…≥????????≥1).Young diagram for ????=[3,2,2,2,1].Your goal is to find the largest number of non-overlap...原创 2019-12-24 01:20:48 · 1036 阅读 · 2 评论 -
C1925 [Wannafly冬令营2018Day4]咆咆咆哮(简单版)(贪心)
思路:想到了ec18年的拿到dp,想了个很假的状态。但是本题要是加攻击力的话,有后效性和前效性,所以不是好办法。顺序不确定,所有可以确定每次选那些加攻击!因为只要确定了加攻击和直接攻击的数目,那么每个人攻击更优还是加攻击更优就已经确定了。每次再排序就ok啦(数据范围也保证能够n方)#include <cstdio>#include <cstring>#inclu...原创 2019-12-24 00:14:49 · 210 阅读 · 0 评论 -
[Wannafly冬令营2018Day4]夺宝奇兵(贪心)
题目描述wlswls 正在玩一个寻宝游戏。宝藏一共有 nn 种,都藏在一个 mm 行 mm 列的网格中。每种宝藏都恰好有两个。wlswls 只能沿着网格走(上下左右四个方向)。他想依次获得 1\cdots n1⋯n 类宝藏,然后再以 n\cdots 1n⋯1 的顺序获得剩下的宝藏。wlswls 可以从任意点出发。当 wlswls 到达某个宝藏的位置时,他可以选择取或不取这个宝藏。请...原创 2019-12-13 16:14:49 · 195 阅读 · 0 评论 -
EC-final2017 J - Straight Master Gym - 101775J(差分,贪心)
A straight is a poker hand containing five cards of sequential rank, not necessarily to be the same suit. For example, a hand containing 7 club, 6 spade, 5 spade, 4 heart and 3 diamond forms a straigh...原创 2019-12-13 00:52:24 · 235 阅读 · 0 评论 -
EC-final2017 B - Scapegoat Gym - 101775B(贪心)
Aori is very careless so she is always making troubles. One day she does it again, with N big troubles! But this time she seems to be at ease because she has found M Inklings to take all the blames. E...原创 2019-12-12 21:27:46 · 254 阅读 · 0 评论 -
D Feeding Chicken cf1255d(贪心)
Long is a huge fan of CFC (Codeforces Fried Chicken). But the price of CFC is increasing, so he decides to breed the chicken on his own farm.His farm is presented by a rectangle grid with ???? rows and ...原创 2019-11-20 13:16:28 · 446 阅读 · 0 评论 -
L 仓鼠养殖计划(贪心)
链接:https://ac.nowcoder.com/acm/contest/96/L来源:牛客网题目描述集训队暑训的时候,是睡在机房的,有几个小伙子不甘寂寞,带了仓鼠来机房。有的还不止带了一只!为此,贴心的集训队刘队长买了一大一小两种放仓鼠笼子的架子,大的可以放两个仓鼠笼 小的只能放一个。要注意的是仓鼠是领地动物,一般来讲 仓鼠笼与仓鼠笼之间是不能贴在一起的,但同一个人带来的仓鼠的仓...原创 2019-04-09 17:02:57 · 311 阅读 · 0 评论