弱鸡的DP之路
SSimpLe_Y
人一我百,人十我万,然而我做不到。
展开
-
hihocoder 1742 树的权重(51Nod-1405 树的距离之和)(树形DP)
描述给定一棵包含N个节点的树,节点编号1~N。 请你对于每一个节点,计算它到所有其他节点的距离之和。(每条边的长度为1)输入第一行包含一个整数N。 以下N-1行,每行包含两个整数a和b,代表ab之间有一条边。 对于30%的数据,1 ≤ N ≤ 1000 对于100%的数据,1 ≤ N ≤ 100000输出输出N行,依次对于1~N号节点输出答案。样例输入4 1 2 2 3 2 4...原创 2018-05-13 15:21:14 · 1109 阅读 · 0 评论 -
长度不超过m的最大连续子序列(dp + 单调队列)
给你n个数,然后让你求最大连续子序列的和,限制条件是连续子序列的长度不超过m。n,m 就是让你找到一个长度不超过m的区间,区间和最大。普通的dp转移方程就是 dp[i] = sum[i] - min(sum[j] | i- m 但是这样的复杂度最坏会达到n^2,所以得优化,就用到了单调队列。针对这题来说一下什么是单调队列,这题我们需要存下距离不超过m,且最小的前缀和的下标。原创 2017-05-13 12:11:51 · 7321 阅读 · 0 评论 -
lightoj 1205 - Palindromic Numbers(数位DP)
A palindromic number or numeral palindrome is a 'symmetrical' number like 16461 that remains the same when its digits are reversed. In this problem you will be given two integers i j, you have to find原创 2017-05-01 16:09:27 · 968 阅读 · 0 评论 -
lightoj 1071 - Baker Vai(双线DP)
All of you must have heard the name of Baker Vai. Yes, he rides a bike and likes to help people. That's why he is popular amongst general people.Baker Vai lives in a city which can be modeled as a 2原创 2016-09-13 13:51:34 · 966 阅读 · 0 评论 -
背包三讲
V表示背包容量,v[i]表示物品价值,w[i]表示物品重量,c[i]表示某种物品的个数1、01背包for(i=0;i<n;i++)//表示物品总个数 for(j=V;j>=w[i];j--) dp[j] = max(dp[j],dp[j-v[i]] + w[i]);2、完全背包for(i=0;i<n;i++)//表示物品总个数 f原创 2016-07-02 16:28:21 · 1382 阅读 · 0 评论 -
lightoj 1246 - Colorful Board
You are given a rectangular board. You are asked to draw M horizontal lines and N vertical lines in that board, so that the whole board will be divided into (M+1) x (N+1) cells. So, there will be M+1r原创 2016-10-14 20:43:15 · 859 阅读 · 0 评论 -
POJ 1050 To the Max
DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangl原创 2016-10-08 17:20:46 · 623 阅读 · 0 评论 -
1030 - Discovering Gold(概率DP?)
You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold.Initially you are in position 1. Now each turn you throw a perfect 6原创 2016-10-05 21:00:23 · 909 阅读 · 0 评论 -
POJ 1651 Multiplication Puzzle(区间DP)
DescriptionThe multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points原创 2016-10-15 10:28:09 · 654 阅读 · 0 评论 -
1422 - Halloween Costumes(区间DP)
Gappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is planning to attend as many parties as he can. Since it's Halloween, these parties are all costume parties, Gap原创 2016-10-15 09:34:36 · 797 阅读 · 0 评论 -
Codeforces Round #426 (Div. 2) D. The Bakery(DP+线段树)
Some time ago Slastyona the Sweetmaid decided to open her own bakery! She bought required ingredients and a wonder-oven which can bake several types of cakes, and opened the bakery.Soon the expens原创 2017-07-31 09:16:44 · 1773 阅读 · 0 评论 -
HDU 2089 不要62 (数位DP)
中文题,题意没什么好说的,就是给你一个区间,问你这个区间里不含62连号的数字有多少个。数位DP的模板题。数位DP一般有两种套路,一种是写出状态转移方程,预处理出来dp数组;另一种套路是写成dfs形势的记忆化搜索,其实DP就是记忆化搜索,只不过把搜索写成了for循环的形势,但是有的时候数位DP写不出状态转移方程,所以还是写成dfs的形势比较靠谱。解释一下程序里一些变量的含义,df原创 2016-08-15 22:05:41 · 897 阅读 · 1 评论 -
状压DP
HDU1074,这题的大意是一个人需要完成他的作业,但是他的老师给他定了期限,每超过期限一天,就扣一分,问你如何安排做作业的顺序,才能使扣的分数最少,输出要扣的最小分数,并输出完成作业的顺序。(科目数目n如果把n个科目进行排序,那么复杂度就有n!,肯定爆炸。其实每一个状态对于一种科目,只有两种可能,一是这个状态下做这个科目,二是不做这个科目,就是1,0两种状态,这样,我们就可以利用二进原创 2016-07-24 21:36:20 · 524 阅读 · 1 评论 -
Codeforces Round #479 F. Consecutive Subsequence(DP)
You are given an integer array of length nn.You have to choose some subsequence of this array of maximum length such that this subsequence forms a increasing sequence of consecutive integers. In other...原创 2018-05-09 11:23:23 · 668 阅读 · 0 评论 -
Codeforces Round #466 (Div. 2) E. Cashback (dp+树状数组+RMQ)
Since you are the best Wraith King, Nizhniy Magazin «Mir» at the centre of Vinnytsia is offering you a discount.You are given an array a of length n and an integer c.The value of some array b of lengt...原创 2018-02-24 21:09:36 · 1020 阅读 · 0 评论 -
Codecraft-18 and Codeforces Round#458 C. Travelling Salesman and Special Numbers(数位DP)
The Travelling Salesman spends a lot of time travelling so he tends to get bored. To pass time, he likes to perform operations on numbers. One such operation is to take a positive integer x and reduce...原创 2018-01-21 13:10:30 · 988 阅读 · 0 评论 -
BZOJ 2442[Usaco2011 Open] 修剪草坪 (dp+单调队列)
Description在一年前赢得了小镇的最佳草坪比赛后,FJ变得很懒,再也没有修剪过草坪。现在,新一轮的最佳草坪比赛又开始了,FJ希望能够再次夺冠。然而,FJ的草坪非常脏乱,因此,FJ只能够让他的奶牛来完成这项工作。FJ有N(1 <= N <= 100,000)只排成一排的奶牛,编号为1…N。每只奶牛的效率是不同的,奶牛i的效率为E_i(0 <= E_i <= ...原创 2018-02-12 12:10:48 · 1014 阅读 · 0 评论 -
SGU 143. Long Live the Queen(树形DP)
The Queen of Byteland is very loved by her people. In order to show her their love, the Bytelanders have decided to conquer a new country which will be named according to the queen's name. This new co原创 2017-10-14 18:22:04 · 916 阅读 · 0 评论 -
SGU 116. Index of super-prime(完全背包+输出路径)
Let P1, P2, … ,PN, … be a sequence of prime numbers. Super-prime number is such a prime number that its current number in prime numbers sequence is a prime number too. For example, 3 is a super-prim原创 2017-09-27 14:38:22 · 968 阅读 · 0 评论 -
Codeforces Round #436 (Div. 2) E. Fire(01背包+输出路径)
Polycarp is in really serious trouble — his house is on fire! It's time to save the most valuable items. Polycarp estimated that it would take tiseconds to save i-th item. In addition, for each item原创 2017-09-26 18:12:08 · 1215 阅读 · 2 评论 -
Manthan, Codefest 17 C. Helga Hufflepuff's Cup(树形DP)
Harry, Ron and Hermione have figured out that Helga Hufflepuff's cup is a horcrux. Through her encounter with Bellatrix Lestrange, Hermione came to know that the cup is present in Bellatrix's famil...原创 2017-09-25 08:43:29 · 1569 阅读 · 0 评论 -
Manthan, Codefest 17 E. Salazar Slytherin's Locket(数位DP)
Harry came to know from Dumbledore that Salazar Slytherin's locket is a horcrux. This locket was present earlier at 12 Grimmauld Place, the home of Sirius Black's mother. It was stolen from there and原创 2017-09-25 07:34:25 · 845 阅读 · 0 评论 -
lightoj 1032 - Fast Bit Calculations
A bit is a binary digit, taking a logical value of either 1 or 0 (also referred to as "true" or "false" respectively). And every decimal number has a binary representation which is actually a series o原创 2016-09-05 21:29:44 · 887 阅读 · 0 评论 -
lightoj 1228 - e-Friends(状压DP)
Social networking web sites are very popular these days. I am not mentioning any names because you know better than me. People do have a lot of e-friends now, "you may not know his real identity but h原创 2016-10-12 18:17:42 · 762 阅读 · 0 评论 -
lightoj 1147 - Tug of War
A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the原创 2016-10-11 19:24:41 · 862 阅读 · 0 评论 -
lightoj 1110 - An Easy LCS (LCS输出路径)
LCS means 'Longest Common Subsequence' that means two non-empty strings are given; you have to find the Longest Common Subsequence between them. Since there can be many solutions, you have to print th原创 2016-09-14 13:03:32 · 822 阅读 · 0 评论 -
lightoj 1084 - Winter
Winter is coming. In a land far away, N men are spending the nights in a valley in a largest field. The valley is so narrow that it can be considered to be a straight line running east-to-west.Altho原创 2016-09-13 17:03:40 · 832 阅读 · 0 评论 -
lightoj 1079 - Just another Robbery(01背包)
As Harry Potter series is over, Harry has no job. Since he wants to make quick money, (he wants everything quick!) so he decided to rob banks. He wants to make a calculated risk, and grab as much mone原创 2016-09-13 14:39:16 · 912 阅读 · 0 评论 -
lightoj 1064 - Throwing Dice
n common cubic dice are thrown. What is the probability that the sum of all thrown dice is at least x?InputInput starts with an integer T (≤ 200), denoting the number of test cases.Each test cas原创 2016-09-09 16:52:29 · 909 阅读 · 0 评论 -
lightoj 1061 - N Queen Again
Given an 8 x 8 chess board where 8 queens are placed in any arbitrary order. You want to move the queens such that no one attacks each other.In each move you can move a queen as in normal chess. Tha原创 2016-09-09 15:48:40 · 856 阅读 · 0 评论 -
hdu5791
Problem DescriptionAlice gets two sequences A and B. A easy problem comes. How many pair of sequence A' and sequence B' are same. For example, {1,2} and {1,2} are same. {1,2,4} and {1,4,2} are not原创 2016-08-02 19:58:43 · 793 阅读 · 0 评论 -
HDU 3652 B-number(数位DP)
这题的意思是给你一个数字n,问你从1到n这个区间内有多少个数中含有13,且能被13整除的数有多少个。在数位DP中记录数字是否含有13,再记录它的模13是多少,到最后一位时含有13且mod为0,就符合条件。(数位DP比较详细的讲解见我博客hdu2089题)#include#include#include#include#define endl '\n'using nam原创 2016-08-15 22:13:59 · 604 阅读 · 0 评论 -
SPOJ BALNUM - Balanced Numbers(数位DP)
这题的大意是给你一个区间,问你在这个区间内满足满足这个数的每一位十进制数字是奇数的有偶数个,是偶数的有奇数个的有多少个。像77,211,6222就是平衡数,而然351,21,622这样的数字就不符合条件。这一题猛一看可能发现并没有什么想法,但再仔细想想,你就会发现。。。。真的没想法一个十进制数最多有10种数字(0~9),每一种数字也只有三种状态,0、一个都没有,1、有奇数个,2原创 2016-08-17 10:47:53 · 821 阅读 · 0 评论 -
lightoj 1125 - Divisible Group Sums
Given a list of N numbers you will be allowed to choose any M of them. So you can choose in NCM ways. You will have to determine how many of these chosen groups have a sum, which is divisible byD.原创 2016-09-15 11:47:21 · 710 阅读 · 0 评论 -
lightoj 1126 - Building Twin Towers
Professor Sofdor Ali is fascinated about twin towers. So, in this problem you are working as his assistant, and you have to help him making a large twin towers.For this reason he gave you some recta原创 2016-09-15 12:48:56 · 917 阅读 · 0 评论 -
lightoj 1134 - Be Efficient
You are given an array with N integers, and another integer M. You have to find the number of consecutive subsequences which are divisible by M.For example, let N = 4, the array contains {2, 1, 4, 3原创 2016-09-16 10:25:38 · 738 阅读 · 0 评论 -
lightoj 1031 - Easy Game(区间DP)
You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take them alternatively. Each player can take one or more numbers from the left or原创 2016-10-11 17:28:36 · 1050 阅读 · 0 评论 -
lightoj 1060 - nth Permutation(逆康拓展开)
Given a string of characters, we can permute the individual characters to make new strings. At first we order the string into alphabetical order. Then we start permuting it.For example the string 'a原创 2016-09-21 14:30:27 · 1029 阅读 · 0 评论 -
lightoj 1158 - Anagram Division
Given a string s and a positive integer d you have to determine how many permutations of s are divisible by d.InputInput starts with an integer T (≤ 200), denoting the number of test cases.Each原创 2016-09-20 19:41:20 · 898 阅读 · 0 评论 -
lightoj 1044 - Palindrome Partitioning
A palindrome partition is the partitioning of a string such that each separate substring is a palindrome.For example, the string "ABACABA" could be partitioned in several different ways, such as {"A原创 2016-09-07 10:10:20 · 912 阅读 · 0 评论