动态规划
文章平均质量分 66
王八变成汤
这个作者很懒,什么都没留下…
展开
-
魔法少女(背包)
前些时间虚渊玄的巨献小圆着实火了一把。 在黑长直(小炎)往上爬楼去对抗魔女之夜时,她遇到了一个问题想请你帮忙。 因为魔女之夜是悬浮在半空的,所以她必须要爬楼,而那座废墟一共有 n 层,而且每层高度不同,这造成小炎爬每层的时间也不同。不过当然,小炎会时间魔法,可以瞬间飞过一层或者两层[即不耗时]。但每次瞬移的时候她都必须要至少往上再爬一层(在这个当儿补充魔力)才能再次使用瞬移。爬每单位高度需要消耗小炎 1 秒时间。 消灭魔女之夜是刻不容缓的,所以小炎想找你帮她找出一种最短时间方案能通往楼顶。输入格式第一行原创 2021-10-20 21:33:39 · 109 阅读 · 0 评论 -
动态规划-字符删除问题
Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the cows pass by a scanner. Each ID tag’s contents are currently a singl原创 2021-10-04 21:58:10 · 110 阅读 · 0 评论 -
修路Making the Grade(动态规划+ 离散化)
A straight dirt road connects two fields on FJ’s farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond of an alternating succession of hills and valleys. FJ would like to add原创 2021-10-03 20:52:02 · 105 阅读 · 0 评论 -
题目:滑雪(优化搜索)
1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12 11 10 9一个人可以从某个点滑向上下左右相邻四个点之一,当且仅当高度减小。在上面的例子中,一条可滑行的滑坡为24-17-16-1。当然25-24-23-...-3-2-1更长。事实上,这是最长的一条。Input输入的第一行表示区域的行数R和列数C(1 <= R,C <= 100)。下面是R行,每行有C个整数,代表高度h,0<=h<=10000.原创 2021-05-15 08:17:10 · 50 阅读 · 0 评论 -
搬宿舍(动态规划)
搬寝室搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2k件过去就行了.但还是会很累,因为2k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度是和左右手的物品的重量差的平方成正比(这里补充一句,xhd每次搬两件东西,左手一件右手一件).例如xhd左手拿重量为3的物品,右手拿重量为6的物品,则他搬原创 2021-07-28 15:56:31 · 122 阅读 · 0 评论 -
公共子序列最长长度(动态规划)Common Subsequence
**Common Subsequence **A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, …, xm> another sequence Z = <z1, z2, …, zk> is a subsequence of X if there exists a stri原创 2021-07-27 10:00:52 · 90 阅读 · 0 评论 -
Milking Time 规定时间挤奶最多(动态规划)
Milking TimeBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0…N-1) so that she produces as much milk as possible.Farmer J原创 2021-07-27 09:44:45 · 128 阅读 · 0 评论 -
Substring 搜索出现数量
**Substring**You are given a string S[1…N] containing only lowercase letters. Now you need to find the longest substring S[l…r]such that every letter (a to z) appears no more than K times in the substring. You just need to output the length (r−l+1) of th原创 2021-07-27 09:29:37 · 114 阅读 · 0 评论 -
动态规划 贪心
标题 楼梯与电梯交换互乘;You are planning to buy an apartment in a nn-floor building. The floors are numbered from 11 to nn from the bottom to the top. At first for each floor you want to know the minimum total time to reach it from the first (the bottom) floor.Let:原创 2021-05-28 21:46:32 · 90 阅读 · 0 评论