dp
live4m
老菜逼了
展开
-
CodeForces1288 C.Two Arrays(dp/组合数学)
C.Two ArraysYou are given two integers n and m. Calculate the number of pairs of arrays (a,b) such that:the length of both arrays is equal to m;each element of each array is an integer between 1 an...原创 2020-01-15 11:36:47 · 2349 阅读 · 2 评论 -
hdu2955 Robberies (01背包)
Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to w...原创 2019-12-07 19:52:12 · 230 阅读 · 0 评论 -
hdu3281 Balls (dp)
Problem DescriptionThe classic Two Glass Balls brain-teaser is often posed as:“Given two identical glass spheres, you would like to determine the lowest floor in a 100-story building from which they...原创 2019-12-01 22:06:38 · 367 阅读 · 0 评论 -
hdu3284 Adjacent Bit Counts (dp)
Problem DescriptionFor a string of n bits x1, x2, x3, …, xn, the adjacent bit count of the string (AdjBC(x)) is given byx1x2 + x2x3 + x3x4 + … + xn-1xnwhich counts the number of times a 1 bit is ad...原创 2019-12-01 21:59:03 · 173 阅读 · 0 评论 -
CodeForces 274 B.Zero Tree(树形dp)
B.Zero TreeA tree is a graph with n vertices and exactly n - 1 edges; this graph should meet the following condition: there exists exactly one shortest (by number of edges) path between any pair of i...原创 2019-11-30 19:25:01 · 704 阅读 · 0 评论 -
CodeForces 461 B.Appleman and Tree(树形dp)
B.Appleman and TreeAppleman has a tree with n vertices. Some of the vertices (at least one) are colored black and other vertices are colored white.Consider a set consisting of k (0 ≤ k < n) edges...原创 2019-11-30 19:16:01 · 194 阅读 · 0 评论 -
数位dp
hdu2089 不要62题意:求[l,r]内满足下列条件的数的个数:1.不含42.不含连续62(连续的例如623,不连续的例如602)code:#include<bits/stdc++.h>using namespace std;const int maxm=10;//题目数据范围最大1e6,即最多7位int digit[maxm];//数位分解int d[maxm...原创 2019-11-24 11:05:34 · 236 阅读 · 0 评论 -
CodeForces 743 D.Chloe and pleasant prizes(树形dp)
D.Chloe and pleasant prizesGenerous sponsors of the olympiad in which Chloe and Vladik took part allowed all the participants to choose a prize for them on their own. Christmas is coming, so sponsors...原创 2019-11-17 10:54:00 · 210 阅读 · 0 评论 -
CodeForces 463 D.Gargari and Permutations(dp,多个排列的最长公共子序列)
题意:给n和k,然后给k个长度为n的1-n的排列要求输出这k个排列的最长公共子序列长度ExamplesInput4 31 4 2 34 1 2 31 2 4 3Output3思路:记录每个串每个数字的分别在自己所在串的位置然后和普通的两个串求最长公共子序列差不多更新的时候需要判断是否每个串的a(1,i)>a(1,j),只有这样才能更新(相对方向一致)code:...原创 2019-11-16 23:23:52 · 219 阅读 · 0 评论 -
CodeForces 721 C.Journey (dfs+dp)
C.JourneyRecently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-direct...原创 2019-11-08 22:28:49 · 289 阅读 · 0 评论 -
CodeForces1256 E.Yet Another Division Into Teams(dp)
E.Yet Another Division Into TeamsThere are n students at your university. The programming skill of the i-th student is ai. As a coach, you want to divide them into teams to prepare them for the upcom...原创 2019-11-06 20:16:18 · 311 阅读 · 0 评论 -
CodeForces686 D.Kay and Snowflake (每棵子树的重心)
D.Kay and SnowflakeAfter the piece of a devilish mirror hit the Kay’s eye, he is no longer interested in the beauty of the roses. Now he likes to watch snowflakes.Once upon a time, he found a huge s...原创 2019-11-05 16:05:17 · 338 阅读 · 0 评论 -
CodeForces706 C.Hard problem (dp)
C.Hard problemVasiliy is fond of solving different tasks. Today he found one he wasn’t able to solve himself, so he asks you to help.Vasiliy is given n strings consisting of lowercase English letter...原创 2019-10-28 12:42:42 · 452 阅读 · 0 评论 -
CodeForces431 C.k-Tree (dp)
C. k-TreeQuite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a k-tree.A k-tree is an infinite ro...原创 2019-10-25 19:47:44 · 180 阅读 · 0 评论 -
CodeForces118 D.Caesar's Legions (dp)
D.Caesar’s LegionsGaius Julius Caesar, a famous general, loved to line up his soldiers. Overall the army had n1 footmen and n2 horsemen. Caesar thought that an arrangement is not beautiful if somewhe...原创 2019-10-25 16:50:42 · 337 阅读 · 1 评论 -
hdu2376 Average distance 树上任意两点距离和 (树形dp)
Problem DescriptionGiven a tree, calculate the average distance between two vertices in the tree. For example, the average distance between two vertices in the following tree is (d01 + d02 + d03 + d0...原创 2019-09-25 12:02:54 · 219 阅读 · 0 评论 -
hdu6567 Cotree (树形dp 树的重心)
Problem DescriptionAvin has two trees which are not connected. He asks you to add an edge between them to make them connected while minimizing the function, where dis(i,j) represents the number of ...原创 2019-09-24 22:12:22 · 326 阅读 · 0 评论 -
CodeForces1221 D.Make The Fence Great Again (dp)
题意:给n个木块的起始高度,和每个木块加一高度的代价,求使得任意相邻木块高度不同的最小代价Example Input332 42 13 532 32 102 641 73 32 61000000000 2Example Output290思路:比赛的时候题都看歪来,以为是所有的高度不同,有毒因为只要和相邻的不同就行了,容易推出最多只需要增长两个单位高度...原创 2019-09-22 16:34:26 · 279 阅读 · 0 评论 -
2019沈阳网络赛C.Dawn-K's water (完全背包)
问题描述Dawn-K最近在东北大学超市发现了一个非常神奇的现象:大包装并不一定比小包装贵这一天,黎明来到超市买矿泉水,他发现有n种矿泉水,他已经知道每种矿泉水的价格p和重量c (kg)。现在,Dawn-K想知道a买不少于m公斤矿泉水最少需要多少钱,以及他能得到的实际重量b。请帮他计算一下。输入输入由多个测试用例组成,每个测试用例以一个数字n (1<=n <=103)开始——类型的...原创 2019-09-15 09:26:20 · 170 阅读 · 0 评论 -
hdu1160 FatMouse's Speed (LIS输出路径)
Problem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as poss...原创 2019-09-07 19:11:04 · 158 阅读 · 0 评论 -
hdu2196 Computer (树形dp换根)
Problem DescriptionA school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of...原创 2019-09-06 13:26:14 · 164 阅读 · 0 评论 -
bzoj4300 绝世好题 (位运算,dp)
绝世好题给定一个长度为n的数列ai,求ai的子序列bi的最长长度,满足bi&bi-1!=0(2<=i<=len)。Input输入文件共2行。第一行包括一个整数n。第二行包括n个整数,第i个整数表示ai。Output输出文件共一行。包括一个整数,表示子序列bi的最长长度。Sample Input31 2 3Sample Output2Hintn<...原创 2019-08-07 22:14:07 · 124 阅读 · 0 评论 -
poj2441 Arrange the Bulls (状态压缩dp)
问题描述有N只牛和M个谷仓(N和M小于等于20)每只牛只喜欢在特定的谷仓里面给出每只牛喜欢的谷仓问所有牛都在自己喜欢的谷仓里的方案数输入在输入的第一行中包含两个整数N和M (1 <= N <= 20, 1 <= M <= 20)。然后是N行。第i行首先包含一个整数P (1 <= P <= M),它表示我喜欢在其中玩耍的谷仓奶牛的数量。然后是P个整数,...原创 2019-07-12 12:39:52 · 122 阅读 · 0 评论 -
poj2385 Apple Catching (dp)
问题描述农夫约翰的田里有两棵苹果树,每棵树上都结满了苹果。贝茜够不到树上的苹果,所以她必须等着苹果掉下来。然而,她必须在空中接住它们,因为苹果落地时会碰伤(没人想吃碰伤的苹果)。贝西吃东西很快,所以她抓到的苹果几秒钟就能吃完。每分钟,两棵苹果树中的一棵都会掉下一个苹果。贝茜很有经验,如果她站在一棵树下,苹果从树上掉下来,她就能抓住苹果。贝茜虽然能在两棵树之间很快地走(不到一分钟),但她每次只能...原创 2019-07-14 13:42:29 · 124 阅读 · 0 评论 -
hdu1069 Monkey and Banana (最长上升子序列变形)(dp)
Monkey and Banana链接:hdu1069问题描述一组研究人员正在设计一个测试猴子智商的实验。他们会把一根香蕉挂在屋顶上,同时给猴子提供一些积木。如果猴子够聪明的话,它应该能够够到香蕉,把一个积木放在另一个积木的上面,建一个塔,然后爬上去得到它最喜欢的食物。研究人员有n种积木,每种积木的数量都是无限的。每一个i型块都是一个具有线性尺寸(xi, yi, zi)的矩形实体。一个物体...原创 2019-07-04 15:31:11 · 261 阅读 · 0 评论 -
hdu 1087 Super Jumping! Jumping! Jumping! (dp)
Super Jumping! Jumping! Jumping!hdu1087问题描述现在,有一种叫“超级跳高”的象棋游戏。跳!跳!在HDU非常受欢迎。也许你是个好孩子,对这个游戏知之甚少,所以我现在就把它介绍给你。这个游戏可以由两个人或两个人以上玩。它由一个棋盘棋(盘)、一些棋子(棋子),和所有的棋子都是由一个正整数或“开始”或“结束”。玩家从起点开始,最终必须跳到终点。在跳跃的过程中,...原创 2019-06-08 14:56:49 · 483 阅读 · 0 评论 -
poj2342 Anniversary party (树形dp,树的最大独立集)
问题描述:Ural大学有N名职员,编号为1~N。他们的关系就像一棵以校长为根的树,父节点就是子节点的直接上司。每个职员有一个快乐指数,用整数 Hi 给出,其中 1≤i≤N。现在要召开一场周年庆宴会,不过,没有职员愿意和直接上司一起参会。在满足这个条件的前提下,主办方希望邀请一部分职员参会,使得所有参会职员的快乐指数总和最大,求这个最大值。输入格式多组案例第一行一个整数N。接下来N...原创 2019-09-01 17:28:49 · 159 阅读 · 0 评论 -
POJ1463 Strategic game (树形dp,树的最小点覆盖)
问题描述鲍勃喜欢玩电脑游戏,特别是战略游戏,但有时他找不到解决问题的方法,这让他很伤心。现在他有以下问题。他必须保护一座中世纪城市,这条城市的道路构成了一棵树。他必须在节点上放置最少数量的士兵,以便他们可以观察到所有的边。你能帮助他吗?例如,下面的树:只需要放置1名士兵(在节点1处),就可观察到所有的边。输入格式输入包含多组测试数据,每组测试数据用以描述一棵树。对于每组测试数...原创 2019-09-01 18:04:20 · 156 阅读 · 0 评论 -
树的重心
树的重心定义:树的重心也叫质心。对于一棵n个节点的无根树,任意找一个点,把树变成以该点为根的有根树时,使得最大子树的结点数最小的点就是这棵树的重心。删除这个点后最大连通块的节点数最少。性质:1.树中所有点到某个点的距离和中,到重心的距离和最小,若有两个重心,他们的距离和一样。2.把两棵树通过任意一条边相连,新的重心一定在原来两棵树重心的连线上。3.一棵树添加或者删除一个节点,树的重心最...原创 2019-09-05 22:09:47 · 256 阅读 · 0 评论 -
poj3585 Accumulation Degree (树形dp二次扫描换根)
问题描述有一个树形的水系,由 N-1 条河道和 N 个交叉点组成。我们可以把交叉点看作树中的节点,编号为 1~N,河道则看作树中的无向边。每条河道都有一个容量,连接 x 与 y 的河道的容量记为 c(x,y)。河道中单位时间流过的水量不能超过河道的容量。有一个节点是整个水系的发源地,可以源源不断地流出水,我们称之为源点。除了源点之外,树中所有度数为 1 的节点都是入海口,可以吸收无限多...原创 2019-09-05 12:16:20 · 173 阅读 · 0 评论 -
P2925干草出售Hay For Sale (01背包+提前结束)
题目描述农民john面临一个很可怕的事实,因为防范失措他存储的所有稻草给澳大利亚蟑螂吃光了,他将面临没有稻草喂养奶牛的局面。在奶牛断粮之前,john拉着他的马车到农民Don的农场中买一些稻草给奶牛过冬。已知john的马车可以装的下C(1 <= C <=50,000)立方的稻草。农民Don有H(1 <= H <= 5,000)捆体积不同的稻草可供购买,每一捆稻草有它自己的...原创 2019-05-30 23:41:49 · 184 阅读 · 0 评论