dp
文章平均质量分 65
elbadaernu
这个作者很懒,什么都没留下…
展开
-
爬楼梯 OpenJ_Bailian - 4017
爬楼梯 OpenJ_Bailian - 4017题目描述 树老师爬楼梯,他可以每次走1级或者2级,输入楼梯的级数,求不同的走法数 例如:楼梯一共有3级,他可以每次都走一级,或者第一次走一级,第二次走两级 也可以第一次走两级,第二次走一级,一共3种方法。Input 输入包含若干行,每行包含一个正整数N,代表楼梯级数,1 <= N <= 30Output 不同的走法数,每一行输入对应一行输出S原创 2017-01-29 19:42:00 · 628 阅读 · 0 评论 -
Minesweeper 1D CodeForces - 404D (dp)
Game “Minesweeper 1D” is played on a line of squares, the line’s height is 1 square, the line’s width is n squares. Some of the squares contain bombs. If a square doesn’t contain a bomb, then it contai原创 2017-09-14 22:36:40 · 370 阅读 · 0 评论 -
免费馅饼 HDU - 1176 (简单dp)
Problem Description 都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身原创 2017-08-29 20:08:15 · 293 阅读 · 0 评论 -
Sagheer, the Hausmeister CodeForces - 812B (简单dp)
Some people leave the lights at their workplaces on when they leave that is a waste of resources. As a hausmeister of DHBW, Sagheer waits till all students and professors leave the university building,原创 2017-08-29 21:08:08 · 465 阅读 · 0 评论 -
滑雪 POJ - 1088 (记忆化搜索)
Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 12 11 10 9一原创 2017-08-29 21:45:24 · 313 阅读 · 0 评论 -
hdu1081 To The Max(最大子矩阵和)
Problem Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. The sum of a r原创 2017-09-25 20:19:07 · 240 阅读 · 0 评论 -
hdu1559 最大子矩阵
Problem Description 给你一个m×n的整数矩阵,在上面找一个x×y的子矩阵,使子矩阵中所有元素的和最大。Input 输入数据的第一行为一个正整数T,表示有T组测试数据。每一组测试数据的第一行为四个正整数m,n,x,y(0#include<cstdio> #include<cstring> #include<algorithm> #include<iostream>原创 2017-09-25 21:56:11 · 352 阅读 · 0 评论 -
Another OCD Patient HDU - 4960 (dp+前缀和)
Xiaoji is an OCD (obsessive-compulsive disorder) patient. This morning, his children played with plasticene. They broke the plasticene into N pieces, and put them in a line. Each piece has a volume Vi.原创 2017-08-31 19:56:28 · 386 阅读 · 0 评论 -
炮 HYSBZ - 4806 (dp)
众所周知,双炮叠叠将是中国象棋中很厉害的一招必杀技。炮吃子时必须隔一个棋子跳吃,即俗称”炮打隔子”。 炮跟炮显然不能在一起打起来,于是rly一天借来了许多许多的炮在棋盘上摆了起来……他想知道,在N×M的矩形 方格中摆若干炮(可以不摆)使其互不吃到的情况下方案数有几种。 棋子都是相同的。 Input 一行,两个正整数N和M。 N<=100,M<=100 Output 一行,输出方案数原创 2017-08-31 21:33:40 · 312 阅读 · 0 评论 -
Bing it UVALive - 4764 (简单dp)
I guess most of you played cards on the trip to Harbin, but I’m sure you have never played the following card game. This card game has N rounds and 100000 types of cards numbered from 1 to 100000. A原创 2017-09-28 21:23:47 · 206 阅读 · 0 评论 -
Dropping water balloons UVA - 10934 (奇怪的dp,思维题)
It’s frosh week, and this year your friends have decided that they would initiate the new computer science students by dropping water balloons on them. They’ve filled up a large crate of identical原创 2017-09-29 21:23:34 · 331 阅读 · 0 评论 -
Common Subsequence HDU - 1159 (lcs简单dp)
Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = #include <iostream> #include <cmath>#include <algorithm>原创 2017-08-29 15:43:07 · 247 阅读 · 0 评论 -
CodeForces - 597 C. Subsequences(dp+线段树or树状数组优化)
For the given sequence with n different elements find the number of increasing subsequences with k + 1 elements. It is guaranteed that the answer is not greater than 8·1018.Input First line contain tw原创 2017-10-05 11:56:38 · 374 阅读 · 0 评论 -
hdu2227 Find the nondecreasing subsequences(dp+线段树or树状数组优化)
Problem Description How many nondecreasing subsequences can you find in the sequence S = {s1, s2, s3, …., sn} ? For example, we assume that S = {1, 2, 3}, and you can find seven nondecreasing subseque原创 2017-10-05 15:41:08 · 232 阅读 · 0 评论 -
The Battle of Chibi HDU - 5542 (dp+离散化+树状数组优化)
Problem Description Cao Cao made up a big army and was going to invade the whole South China. Yu Zhou was worried about it. He thought the only way to beat Cao Cao is to have a spy in Cao Cao’s army.原创 2017-10-05 17:47:46 · 271 阅读 · 0 评论 -
hdu3450 Counting Sequences(dp+离散化+树状数组优化)
Problem Description For a set of sequences of integers{a1,a2,a3,…an}, we define a sequence{ai1,ai2,ai3…aik}in which 1<= i1 < i2< i3<…< ik<=n, as the sub-sequence of {a1,a2,a3,…an}. It is quite obvious原创 2017-10-05 23:22:57 · 256 阅读 · 0 评论 -
HDU 1712 ACboy needs your help (分组背包)
Problem Description ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arr原创 2017-12-09 16:23:09 · 214 阅读 · 0 评论 -
HDU 5550 Game Rooms (dp+前缀和预处理)
Problem Description Your company has just constructed a new skyscraper, but you just noticed a terrible problem: there is only space to put one game room on each floor! The game rooms have not been fu原创 2017-12-06 01:57:56 · 380 阅读 · 0 评论 -
最大连续子序列 HDU - 1231(dp)
Problem Description 给定K个整数的序列{ N1, N2, …, NK },其任意连续子序列可表示为{ Ni, Ni+1, …, Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个, 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为20。 在原创 2017-08-29 16:46:02 · 283 阅读 · 0 评论 -
Happy Matt Friends HDU - 5119 (dp+滚动数组优化)
Matt has N friends. They are playing a game together. Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (exclusive-or) sum of the sele原创 2017-09-05 15:42:23 · 335 阅读 · 0 评论 -
The Triangle POJ - 1163
The Triangle POJ - 1163题目描述 7 3 8 8 1 0 2 7 4 44 5 2 6 5 (Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbe原创 2017-01-30 21:19:02 · 339 阅读 · 0 评论 -
Charm Bracelet POJ - 3624
Charm Bracelet POJ - 3624题目描述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 the N (1 ≤ N ≤ 3,402) available原创 2017-01-31 12:30:51 · 437 阅读 · 0 评论 -
hdu 1231 最大连续子序列 (dp)
题目描述 给定K个整数的序列{ N1, N2, …, NK },其任意连续子序列可表示为{ Ni, Ni+1, …, Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个, 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为20。 在今年的数据结构考卷中,要求编写原创 2017-04-06 22:29:02 · 224 阅读 · 0 评论 -
hdu 1203 I NEED A OFFER!
题目描述 Speakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得到这个学校offer的可能性b。原创 2017-04-06 23:39:53 · 577 阅读 · 0 评论 -
HDU - 1421 搬寝室
Problem Description 搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度是和左原创 2017-04-07 11:21:53 · 271 阅读 · 0 评论 -
HDU - 1159 Common Subsequence
Problem Description 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原创 2017-04-07 17:24:55 · 221 阅读 · 0 评论 -
POJ - 2533 Longest Ordered Subsequence
DescriptionA numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), where 1 <= i1 < i2 < … < iK <=原创 2017-04-07 17:46:44 · 304 阅读 · 0 评论 -
Covered Path CodeForces - 534B
Covered Path题目描述 The on-board computer on Polycarp’s car measured that the car speed at the beginning of some section of the path equals v1 meters per second, and in the end it is v2 meters per second原创 2017-03-13 14:08:46 · 389 阅读 · 0 评论 -
HDU 1284 钱币兑换问题
Problem Description 在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。Input 每行只有一个正整数N,N小于32768。Output 对应每个输入,输出兑换方法数。Sample Input 2934 12553Sample Output 718831 13137761思路:简单的dp代码如下#include<iost原创 2017-04-08 17:18:41 · 613 阅读 · 0 评论 -
codevs 3342 绿色通道(二分+dp+优先队列or单调队列)好题
题目描述 Description 《思远高考绿色通道》(Green Passage, GP)是唐山一中常用的练习册之一,其题量之大深受lsz等许多oiers的痛恨,其中又以数学绿色通道为最。2007年某月某日,soon-if (数学课代表),又一次宣布收这本作业,而lsz还一点也没有写……高二数学《绿色通道》总共有n道题目要写(其实是抄),编号1..n,抄每道题所花时间不一样,抄第i题要花a[i]原创 2017-05-23 16:23:53 · 1098 阅读 · 1 评论 -
codevs 3027 线段覆盖 2 (简单dp)
题目描述 Description 数轴上有n条线段,线段的两端都是整数坐标,坐标范围在0~1000000,每条线段有一个价值,请从n条线段中挑出若干条线段,使得这些线段两两不覆盖(端点可以重合)且线段价值之和最大。n<=1000输入描述 Input Description 第一行一个整数n,表示有多少条线段。接下来n行每行三个整数, ai bi ci,分别代表第i条线段的左端点ai,右端点bi(原创 2017-05-25 22:40:05 · 479 阅读 · 0 评论 -
codevs 1214 线段覆盖(贪心 or dp)
题目描述 Description 给定x轴上的N(0< N<100)条线段,每个线段由它的二个端点a_I 和b_I确定,I=1,2,……N.这些坐标都是区间(-999,999)的整数。有些线段之间会相互交叠或覆盖。请你编写一个程序,从给出的线段中去掉尽量少的线段,使得剩下的线段两两之间没有内部公共点。所谓的内部公共点是指一个点同时属于两条线段且至少在其中一条线段的内部(即除去端点的部分)。原创 2017-05-25 21:32:50 · 378 阅读 · 0 评论 -
codevs 3012 线段覆盖4(dp+二分优化)
题目描述 Description 数轴上有n条线段,线段的两端都是整数坐标,坐标范围在0~1000000,每条线段有一个价值,请从n条线段中挑出若干条线段,使得这些线段两两不覆盖(端点可以重合)且线段价值之和最大。输入描述 Input Description 第一行一个整数n,表示有多少条线段。接下来n行每行三个整数, ai bi ci,分别代表第i条线段的左端点ai,右端点bi(保证左端点<右原创 2017-05-26 12:18:10 · 475 阅读 · 0 评论 -
codevs 3037 线段覆盖5 (dp+二分+快排)
题目描述 Description 数轴上有n条线段,线段的两端都是整数坐标,坐标范围在0~10^18,每条线段有一个价值,请从n条线段中挑出若干条线段,使得这些线段两两不覆盖(端点可以重合)且线段价值之和最大。输入描述 Input Description 第一行一个整数n,表示有多少条线段。接下来n行每行三个整数, ai bi ci,分别代表第i条线段的左端点ai,右端点bi(保证左端点<右端点原创 2017-05-26 12:39:50 · 456 阅读 · 0 评论 -
codevs1060 搞笑世界杯(dp)
题目描述 Description 随着世界杯小组赛的结束,法国,阿根廷等世界强队都纷纷被淘汰,让人心痛不已. 于是有人组织了一场搞笑世界杯,将这些被淘汰的强队重新组织起来和世界杯一同比赛.你和你的朋友欣然去购买球票.不过搞笑世界杯的球票出售方式也很特别,它们只准备了两种球票.A 类票——免费球票 B 类票——-双倍价钱球票.购买时由工作人员通过掷硬币决定,投到正面的买A类票, 反面的买B类原创 2017-05-30 21:20:15 · 438 阅读 · 0 评论 -
Arpa's weak amphitheater and Mehrdad's valuable Hoses CodeForces - 742D
Arpa’s weak amphitheater and Mehrdad’s valuable Hoses CodeForces - 742D题目描述 Just to remind, girls in Arpa’s land are really nice.Mehrdad wants to invite some Hoses to the palace for a dancing party. E原创 2017-02-01 18:17:06 · 543 阅读 · 0 评论 -
The Values You Can Make CodeForces - 687C (dp)
Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci. The price of the chocolate is k, so Pari will take a subset of her coins with sum equal to k and g原创 2017-09-05 14:51:00 · 235 阅读 · 0 评论 -
2017北京网络赛 hihocoder 1580 Matrix (dp很好的思维题)
时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 Once upon a time, there was a little dog YK. One day, he went to an antique shop and was impressed by a beautiful picture. YK loved it very much.However, YK di原创 2017-11-28 00:34:13 · 320 阅读 · 0 评论