贪心
文章平均质量分 82
nike0good
这个作者很懒,什么都没留下…
展开
-
Hello 2024 题解
B. Plus-Minus SplitC. Grouping Increases给一个数列,不改变相对顺序前提拆成2个数列。问这2个数列中,相邻且前一个数小于后一个数的数对的最小值贪心,维护2个数列队尾的值,如果都会增加数对或都不会,则放到队尾数小的那个。不然放不会增加数对的那个。D. 01 Tree给一个树,所有非叶子节点均有左右2个子节点,边权分别0和1(可以对调)。已知所有叶子节点的按dfs序排列后的到根的最短路径长。问是否合法?dfs_order = []function dfs(原创 2024-01-13 19:32:58 · 1103 阅读 · 1 评论 -
CodeJam Qualification Round 2022
Punched Cards (11pts)Attempts1Penalties0Penalty Time25:02:57PointsdonePractice SubmissionsYou have not attempted this problem.Last updated: Apr 3 2022, 12:13PROBLEMANALYSISProblemA secret team of programmers is plotting to disrupt the progra原创 2022-04-03 12:21:44 · 624 阅读 · 0 评论 -
CF 538B(Quasi Binary-贪心)
B. Quasi Binarytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA number is called quasibinary if its decim原创 2015-04-28 23:21:10 · 1860 阅读 · 0 评论 -
CF 538D(Weird Chess-反过来算)
D. Weird Chesstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIgor has been into chess for a long time and原创 2015-04-28 23:32:29 · 1462 阅读 · 0 评论 -
CF 538C(Tourist's Notes-贪心)
C. Tourist's Notestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tourist hiked along the mountain range原创 2015-04-28 23:24:08 · 1466 阅读 · 0 评论 -
Chang'an(Dance Party-贪心)
贪心,尽量向前配#include using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define ForD(i,n) for(int i=n;i;i--原创 2015-04-23 11:37:33 · 1045 阅读 · 0 评论 -
GCJ 2015Q(Infinite House of Pancakes-贪心与枚举)
ProblemAt the Infinite House of Pancakes, there are only finitely many pancakes, but there are infinitely many diners who would be willing to eat them! When the restaurant opens for breakfast, among原创 2015-04-12 14:46:52 · 1754 阅读 · 0 评论 -
GCJ 2015Q(Standing Ovation-贪心)
ProblemIt's opening night at the opera, and your friend is the prima donna (the lead female singer). You will not be in the audience, but you want to make sure she receives a standing ovation -- w原创 2015-04-12 14:38:24 · 1194 阅读 · 0 评论 -
hiho 挑战赛10(01串-找规律决策)
题目1 : 01串时间限制:7000ms单点时限:1000ms内存限制:256MB描述给定两个整数n和m,求是否存在恰好包含n个0和m个1的01串S,使得S中不存在子串"001"和"11"。如果存在符合条件的01串则输出字典序最小的S,否则输出NO。输入一行两个整数,表示n和m。(0输出一行一个字符串,为字典序原创 2015-04-12 23:34:28 · 1472 阅读 · 0 评论 -
BestCoder Round #35(DZY Loves Topological Sorting-堆+贪心)
DZY Loves Topological SortingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 323 Accepted Submission(s): 86Problem DescriptionA原创 2015-03-29 12:53:08 · 1215 阅读 · 0 评论 -
CF 525C(Ilya and Sticks-贪心)
C. Ilya and Stickstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the evening, after the contest Ilya w原创 2015-03-27 17:21:20 · 1339 阅读 · 0 评论 -
CF 525B(Pasha and String-贪心+找规律)
B. Pasha and Stringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha got a very beautiful string s for原创 2015-03-27 17:18:21 · 1368 阅读 · 0 评论 -
CF 525D(Arthur and Walls-贪心2*2方格补全)
D. Arthur and Wallstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFinally it is a day when Arthur has eno原创 2015-03-27 20:18:11 · 1319 阅读 · 0 评论 -
LA 5916(GCD Guessing Game-质数分组)
现在有一个数x,1 ≤ x≤ n,告诉你n,每次你可以猜一个数y,如果x==y则结束,否则返回gcd(x,y),问最少只要几次就可以保证猜出答案。Input The input file contains several test cases, each of them as described below.The input contains one integer n, 2原创 2013-04-22 13:49:47 · 1592 阅读 · 0 评论 -
CF 518E(Arthur and Questions-贪心)
E. Arthur and Questionstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter bracket sequences Arthur took原创 2015-02-25 15:27:55 · 1448 阅读 · 0 评论 -
CF 518B(Tanya and Postcard-计数统计)
B. Tanya and Postcardtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Tanya decided to present her d原创 2015-02-25 15:01:00 · 1320 阅读 · 0 评论 -
CF 509B(Painting Pebbles-贪心)
B. Painting Pebblestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n piles of pebbles on the tabl原创 2015-02-03 14:50:39 · 1256 阅读 · 0 评论 -
CF 557B(Pasha and Tea-贪心)
B. Pasha and Teatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha decided to invite his friends to a te原创 2015-07-01 21:05:33 · 1581 阅读 · 0 评论 -
CF 557A(Ilya and Diplomas-贪心)
A. Ilya and Diplomastime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSoon a school Olympiad in Informatics w原创 2015-07-01 21:08:09 · 1474 阅读 · 0 评论 -
HDU 5353(Average-贪心分果)
AverageTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2153 Accepted Submission(s): 532Special JudgeProblem DescriptionThere ar原创 2015-08-11 23:35:40 · 839 阅读 · 0 评论 -
字节跳动冬令营网络赛(B.Origami-折纸)
链接:https://ac.nowcoder.com/acm/contest/296/B来源:牛客网Chiaki has a very big sheet of paper. This sheet has a form of rectangle with dimensions 1 x n and numbers from 1 to n was written on each small 1 x...原创 2018-12-02 16:04:57 · 603 阅读 · 0 评论 -
BZOJ 4151([AMPPZ2014]The Cave-树,贪心)
题意:给一棵n个节点的树和m条限制,每条限制形如dis(x,ai)+dis(x,bi)≤didis(x,a_i)+dis(x,b_i)\le d_i,其中dis(a,b)dis(a,b)表示a到b经过的边的个数。问图中是否存在x满足所有限制,有的话输出任意一个合法解,否则输出无解。设x为根。 依次遍历每条限制,如果ai,bia_i,b_i 均在x的子树中且限制不成立,那么x向这2个点的lca到x的原创 2018-01-04 14:59:22 · 611 阅读 · 0 评论 -
2017-2018 ACM-ICPC, NEERC, Northern Subregional Contest(Dividing Marbles-构造)
有一堆n=2d1+2d2+2d3+2d4n=2^{d_1}+2^{d_2}+2^{d_3}+2^{d_4}个石子。现在每次操作都选择一堆,分成两堆,使每堆至少有一颗石子,之后如果场上有相同数量的石子堆,则只保留一堆。问至少几次操作使石子只剩1个。显然可以先将n化成2进制。 如果1的个数不超过3,可以这样 10101 10101->10000 +100 +1 //2步 10000 -> 10原创 2017-11-15 06:10:23 · 1467 阅读 · 4 评论 -
CF 883D(Packmen Strike Back-吃豆人)
一条序列上有n个空位,上面要么是吃豆人,要么是豆,要么是空位。现在给每个吃豆人指定一个方向,游戏开始后每个吃豆人同时向前移动直到遇到边界后不动。问吃豆人最多能吃几个豆子,已经这个前提下最小花费时间。显然又2个吃豆人就能吃完所有豆子。 二分时间。 dpidp_i表示前i个吃豆人最远能吃到从左端点开始到dpidp_i的豆子。 那么有2种情况。 要么前i−1i-1个吃豆人吃了1~dp[i-1],原创 2017-11-04 21:00:32 · 1663 阅读 · 2 评论 -
POJ 2054(Color a Tree-贪心)
有一棵树,树上有n个节点,每个节点点权cic_i,rr是根节点。现在你希望依次取点,一个节点能取当且仅当它的父节点已取或它是根,第i个取的点j代价为i∗cji*c_j ,求代价和最小值。贪心,交换法可以证明最大值的点必然在其父节点后马上取,因此每次拿出最大值节点和父节点合并,重复该操作直至只剩一个节点。#include<cstdio>#include<cstring>#include<cstdl原创 2017-07-18 07:44:28 · 418 阅读 · 0 评论 -
GCJ Round 1A 2017 题解
A Alphabet Cake给一个R*C矩阵,里面有大写字母和?(大写字母每个最多出现一次),用矩阵中出现的大写字母填满矩阵,要求每个字母出现的区域都恰为一子矩阵。 直接把每个字母向行延展,后向列延展。#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i原创 2017-04-16 00:40:45 · 811 阅读 · 0 评论 -
NEERC 2014 题解(待续)
Alter BoardBurrito KingEpic WinFilterImprovementsJokewithpermutationKnockout Racing7/12原创 2016-10-20 22:11:18 · 961 阅读 · 1 评论 -
西安十五日游day7 博弈专题
HDU 3863 No GamblingHDU 2176 取m堆石子游戏HDU 2177 取2堆石子游戏HDU 2486 A simple stone gameHDU 1404 Digital DeletionsHDU 1729 Stone GameHDU 1760 A New Tetris GameHDU 1907 JohnHDU 2234 无题IHDU 2368 Alfredo原创 2016-08-10 08:24:47 · 527 阅读 · 0 评论 -
小鸡腿U T6 2013FINAL
Self-AssemblyLow PowerPollution SolutionSelf-Assembly拆点连边,用拓扑排序判定有没有环#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<functional>#include<iostream>#include<cmath>#原创 2016-08-21 11:05:51 · 420 阅读 · 0 评论 -
CF 601B(Lipshitz Sequence-贪心)
给一个序列长度为n(<=100,000) ,q(<=100)个询问 定义一个串的常数L(h) if n < 2, L(h)=0L(h)=0 if n ≥ 2, max⌈∣∣hj−hij−i∣∣⌉max{\left\lceil \left| \frac {h_j-h_i} {j-i} \right|\right\rceil } over all 1 ≤ i < j ≤ n 对每个询问(l,r原创 2015-11-26 08:51:22 · 883 阅读 · 0 评论 -
CF 605A(Sorting Railway Cars-贪心)
给一个序列为1~n的一个排列,每次从序列中任意取一个数扔到开头或末尾,求使数列有序的最小操作次数。一开始以为LIS,实际不是 要求 the longest subsegment of pos, where pos[a], pos[a+1], …, pos[b] is increasing. #include<cstdio>#include<cstring>#include<cstdlib>原创 2015-12-11 16:07:59 · 876 阅读 · 0 评论 -
HDU 5527(Too Rich-贪心)
给面额c1,c5,c10,c20,c50,c100,c200,c500,c1000,c2000硬币若干,让你用最多的钱币凑出恰好p元,可能无解这道题是2015长春区域赛的金牌题。。场外头脑风暴一个晚上+一个中午,推翻大量算法的路过一般的贪心法是尽可能多取小面额硬币,但是这样可能会被p=70 (20,20,20,50) 卡掉,因为贪心取20结果答案变成无解原因是20凑不出50.所以我们考虑50取奇数原创 2015-11-11 21:26:21 · 921 阅读 · 0 评论 -
CF 584E(Anton and Ira-构造+贪心)
已知2个排列a,b,交换第i位位与第j位代价=abs(i-j) ,求把排列a变成排列b最小代价及任一合法方案先把第一个排列变成顺序的我们考虑对 ii 最终要移到bib_i ,代价=|i−bi||i-b_i| 最小总代价ans=12∑ni=1|i−bi|ans=\frac1 2 \sum_{i=1}^n|i-b_i|不妨假设这是答案, 那么每个数只能往一个方向挪, 我们从n开始,不断找可以交换原创 2015-10-13 13:17:19 · 1062 阅读 · 0 评论 -
CF 582A(GCD Table-贪心)
已知一个序列,两两gcd得到一张表 (图为4,3,6,24,3,6,2) 现在给出表中所有项(不按顺序),给出原序列一个合法解预处理,把gcd表存为i的倍数在表中出现hih_i次,显然hih_i是完全平方数,取根号得到序列中i的倍数出现几次 贪心取最大的那个,把它从gcd表中删去,再取..#include<cstdio>#include<cstring>#include<cstdlib>#原创 2015-10-04 22:31:55 · 904 阅读 · 0 评论 -
CF 567B(Berland National Library-看成折线图)
B. Berland National Librarytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland National Library has rec原创 2015-08-06 17:03:55 · 851 阅读 · 0 评论 -
CF 508C(Anya and Ghosts-贪心)
C. Anya and Ghoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to watch horror movies. In th原创 2015-01-29 20:16:29 · 1063 阅读 · 0 评论 -
CF 505B(Anton and currency you all know-贪心)
B. Anton and currency you all knowtime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland, 2016. The exc原创 2015-01-28 17:13:46 · 1569 阅读 · 0 评论 -
CF 496C(Removing Columns-贪心取字典序)
A. Removing Columnstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an n × m rectangular tabl原创 2014-12-18 13:08:46 · 1480 阅读 · 0 评论 -
UVA 11729(Commando War-按执行时间贪心)
GCommando WarInput: Standard InputOutput: Standard Output “Waiting for orders we held in the wood, word from the front never cameBy evening the sound of the gunfire was mi原创 2013-03-16 20:15:21 · 1286 阅读 · 0 评论 -
UVA 11292(Dragon of Loowater-勇者斗恶龙)
Problem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a prime b原创 2013-03-10 09:16:46 · 1802 阅读 · 0 评论