动态规划
Raytheon 1715313189
这个人是条懒狗,什么也没留下...
展开
-
Super Jumping! Jumping! Jumping! HDU - 1087 (最长不下降【上升】子序列的和)你绝对能看懂的动态规划!!!!
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.The game can...原创 2019-03-31 13:22:35 · 224 阅读 · 1 评论 -
最少拦截系统 HDU - 1257(你绝对能看懂的入门经典动态规划!!!!)
某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一下最少需要多少套拦截系...原创 2019-03-31 13:46:56 · 607 阅读 · 8 评论 -
笑死我了哈哈哈哈Common Subsequence HDU - 1159(什么!?动态规划经典题目这么容易看懂?!!!!)
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...原创 2019-03-31 16:53:52 · 199 阅读 · 0 评论 -
(你绝对能看懂的的0-1背包问题!!!!)动态规划进阶题目之Charm Bracelet
题目描述Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from theN(1 ≤N≤ 3,402) available charms. Each charmi...原创 2019-04-11 20:35:08 · 345 阅读 · 0 评论 -
(薯塔我又又又双双叒叕饿啦!!!!)动态规划基础题目之数字三角形
题目描述73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the...原创 2019-04-17 21:44:49 · 119 阅读 · 0 评论 -
(烟大食堂是亚洲最大食堂,接受任何反驳。。。)动态规划进阶题目之开餐馆
题目描述北大信息学院的同学小明毕业之后打算创业开餐馆.现在共有n个地点可供选择。小明打算从中选择合适的位置开设一些餐馆。这n个地点排列在同一条直线上。我们用一个整数序列m1, m2, ... mn来表示他们的相对位置。由于地段关系,开餐馆的利润会有所不同。我们用pi表示在mi处开餐馆的利润。为了避免自己的餐馆的内部竞争,餐馆之间的距离必须大于k。请你帮助小明选择一个总利润最大的...原创 2019-04-18 20:53:16 · 577 阅读 · 0 评论 -
(D8Q,当场抓获!!!)动态规划进阶题目之大盗阿福
题目描述阿福是一名经验丰富的大盗。趁着月黑风高,阿福打算今晚洗劫一条街上的店铺。这条街上一共有N家店铺,每家店中都有一些现金。阿福事先调查得知,只有当他同时洗劫了两家相邻的店铺时,街上的报警系统才会启动,然后警察就会蜂拥而至。作为一向谨慎作案的大盗,阿福不愿意冒着被警察追捕的风险行窃。他想知道,在不惊动警察的情况下,他今晚最多可以得到多少现金?输入输入的第一行是一个整数...原创 2019-04-18 21:04:10 · 560 阅读 · 0 评论 -
(她是什么神仙颜值啊啊啊啊啊啊啊啊!!!)1007 Maximum Subsequence Sum (25 分)
Given a sequence ofKintegers {N1,N2, ...,NK}. A continuous subsequence is defined to be {Ni,Ni+1, ...,Nj} where1≤i≤j≤K. The Maximum Subsequence is the continuous subseque...原创 2019-04-30 22:36:21 · 144 阅读 · 0 评论 -
(高考加油!!!@大肥)1045 Favorite Color Stripe (30 分)
Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted pieces and sewing the remaining par...原创 2019-06-05 16:53:30 · 183 阅读 · 0 评论