![](https://img-blog.csdnimg.cn/20190918140145169.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
ACM训练题解
文章平均质量分 85
ACM训练题解
Biangbangbing
这个作者很懒,什么都没留下…
展开
-
ACM题解——动态规划专题——treats
ACM题解——动态规划专题——奶牛食物的最大收益题目描述FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a given period time.The treat原创 2021-03-01 18:19:38 · 439 阅读 · 0 评论 -
ACM题解——动态规划系列——最长升序子序列
ACM题解——动态规划系列——最长升序子序列题目描述A numeric sequence ofaiis ordered ifa1<a2< ... <aN. Let the subsequence of the given numeric sequence (a1,a2, ...,aN) be any sequence (ai1,ai2, ...,aiK), where 1 <=i1<i2< ... <iK<=N...原创 2021-02-28 17:00:04 · 751 阅读 · 0 评论 -
ACM题解——动态规划专题——“Help Jimmy“
ACM题解——动态规划专题——"Help Jimmy"题目描述"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy落到某个平台上时,游戏者选择让它向左还是向右跑,它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时,开始继续下落。Jimmy每次下落的高度不能超过MAX米,不然就会摔死,游戏也会结束。设计一.原创 2021-02-24 23:11:50 · 366 阅读 · 1 评论 -
ACM题解——动态规划专题——卖电影票
ACM题解——动态规划专题——卖电影票题目描述Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.A good approach原创 2021-02-24 20:27:22 · 563 阅读 · 0 评论 -
ACM题解——动态规划专题——G天上掉馅饼
ACM题解——动态规划专题——G.天上掉馅饼题目描述都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特别迟钝,每秒种只有在移动不超过一米的范围内接住坠落的原创 2021-02-24 18:52:34 · 1219 阅读 · 0 评论 -
ACM题解——训练赛2_D - The Beatles
ACM题解——训练赛2_D - The Beatles题目描述ExamplesInput2 31 1Output1 6Input3 20 0Output1 3Input1 105 3Output5 5题意有n端长为k的的线段围成一个圈,每一段开头一号点为restaurant点,共n个,现在已知初始位置s距离其最近的restaurant点的距离为a,它开始沿某一方向运动,每运动一次长度..原创 2021-02-13 20:05:35 · 116 阅读 · 0 评论 -
ACM题解——训练赛2_B - Nirvana
ACM题解——训练赛2_B - Nirvana题目描述B - NirvanaKurt reaches nirvana when he finds the product of all the digits of some positive integer. Greater value of the product makes the nirvana deeper.Help Kurt find the maximum possible product of digits among al原创 2021-02-13 14:36:50 · 210 阅读 · 0 评论 -
ACM题解——训练赛1_F
ACM题解——训练赛1_FF - Jumping JackJack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the pointx. In order to train, he has decided that he'll first jump by only one unit, and ea.原创 2021-02-11 10:21:15 · 236 阅读 · 0 评论 -
ACM题解——训练赛1_A
ACM题解——训练赛1_A题(应该算一道数学题)题目描述A - TetrahedronYou are given a tetrahedron. Let's mark its vertices with lettersA,B,CandDcorrespondingly. An ant is standing in the vertexDof the tetrahedron. The ant i...原创 2021-02-10 13:37:52 · 289 阅读 · 0 评论 -
ACM题解——贪心——卫星安装
ACM题解——贪心——卫星安装转化类似节目安排问题题目描述Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only c原创 2021-02-10 11:25:13 · 219 阅读 · 0 评论 -
ACM题解——贪心——奶牛叫声
ACM——贪心——奶牛场题目描述Farmer John has received a noise complaint from his neighbor, Farmer Bob, stating that his cows are making too much noise.FJ's N cows (1 <= N <= 10,000) all graze at various locations on a long one-dimensional pasture. The c.原创 2021-02-09 19:10:39 · 236 阅读 · 0 评论 -
ACM题解——贪心——调度问题
ACM题解——贪心——调度问题题目描述Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will r原创 2021-02-09 15:43:17 · 945 阅读 · 0 评论 -
ACM题解——贪心专题——木头加工
ACM题解——贪心之木头加工题目描述There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to原创 2021-02-09 10:55:32 · 479 阅读 · 0 评论 -
ACM杂题I——不知什么解法就是解出来的题解(应该不是递归)
ACM杂题I——Subset sequence题解题目描述Consider the aggregate An= { 1, 2, …, n }. For example, A1={1}, A3={1,2,3}. A subset sequence is defined as a array of a non-empty subset. Sort all the subset sequece of An in lexicography order. Your task is to find the m原创 2021-01-31 20:14:27 · 147 阅读 · 0 评论 -
ACM杂题——动态规划_背包问题
ACM杂题K - I NEED A OFFER!——动态规划_背包问题优化解法题目描述Speakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得到这个学校offer的可能性b。不同学校之间是否得到off原创 2021-01-30 22:06:42 · 202 阅读 · 0 评论 -
2021-01-30ACM——高精指数函数
ACM题解——杂题Q题目描述Q - ExponentiationProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.This problem req原创 2021-01-30 19:55:33 · 311 阅读 · 0 评论