DP
Charon_HN
NLP炼丹儿
展开
-
hdu 调查问卷(暴力状压入门)
题目这道题目是典型的状压问题,但是还不至于用DP,题目也没让求最优方案,爆搜就行,用两种方法#include<bits/stdc++.h>using namespace std;const int N = 1e5;int val[N];typedef map<int, int> R;int main(){ ios::sync_with_stdi...原创 2018-08-09 20:21:57 · 163 阅读 · 0 评论 -
HDU 1704 二进制的应用于状压DP
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after th...原创 2018-09-08 19:29:54 · 209 阅读 · 0 评论 -
codeforces 580D. Kefa and Dishes(状压dp)
题目传送门题目大意:有n种菜,你可以选择m种,但是还有k种规则或者说是条件,每一种菜都有一定的满意度,按顺序吃的话也会获得一定的满意度,要你求出最大的满意度是多少比如第1的样例2种菜,每种菜的满意度都是1,还有一种规则就是按照吃完2号菜再吃一号菜就会获得值为1的满意度因为只有两种状态吃 或者 不吃,因此可以用1 0表示其状态,又因为n<20,所以用状压DP可以的(我也想过用区间D...原创 2018-08-09 14:07:56 · 190 阅读 · 0 评论 -
2019 蓝桥杯省赛 A 组模拟赛(一)计蒜客 A2229
题目链接:https://vjudge.net/problem/%E8%AE%A1%E8%92%9C%E5%AE%A2-A2229某班有 nn 个同学,每个同学有一个外向程度 a_iai 。由于要进行某个活动,需要把他们分成若干个小组,每个小组的人数至少为 mm 人。不同外向程度的人在一个小组会产生不开心值,定义一个小组的不开心值为组内成员外向程度最大值和最小值的差,一个班级的不开心值为...原创 2020-02-19 23:09:34 · 886 阅读 · 0 评论 -
POJ 1742 多重背包(单调队列的优化)的可行性问题OR多重部分和问题
People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearb...原创 2018-11-02 22:19:45 · 237 阅读 · 0 评论 -
POJ 1276 多重背包+多重背包可行化问题+单调队列优化
A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k...原创 2018-11-03 19:59:25 · 234 阅读 · 0 评论 -
POJ 3666 非严格单调递增或非严格单调递减
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 alternatin...原创 2018-11-01 16:44:25 · 2336 阅读 · 0 评论 -
POJ 2184 变形01背包
Description "Fat and docile, big and dumb, they look so stupid, they aren't much fun..." - Cows with Guns by Dana Lyons The cows want to prove to the public that they are both smar...原创 2018-10-09 17:11:39 · 163 阅读 · 0 评论 -
POJ 2392 多重背包
The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to buil...原创 2018-10-04 17:45:45 · 284 阅读 · 0 评论 -
POJ 1065 贪心+链-反链-Dilworth定理的应用+ POJ3636 排序方案的不同
Wooden SticksTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 26050 Accepted: 11277 DescriptionThere is a pile of n wooden sticks. The length and weight of each stick...原创 2018-09-20 16:24:07 · 152 阅读 · 0 评论 -
codeforces 1105c Ayoub and Lost Array 利用余数进行dp或者是递推???
题目链接https://codeforces.com/contest/1105/problem/C题意:从ll到rr中选nn个数,允许相同。要使最终这nn个数的和是33的倍数,求有多少个方案,答案modmod109+7109+7。(若没有方案,输出00)这题首先很难看出来是DP--QAQ,反正我是看不出来,然后看的题解才知道,可以用DP的;首先你需要这...原创 2019-03-06 19:54:10 · 512 阅读 · 0 评论 -
CodeForces 1061C dpMultiplicity
参考:https://blog.csdn.net/wjl_zyl_1314/article/details/84503454Multiplicitytime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an...原创 2019-03-06 21:30:19 · 282 阅读 · 0 评论 -
Codeforces 1051D Bicolorings(三维dp)
BicoloringsYou are given a grid, consisting of 22 rows and nn columns. Each cell of this grid should be colored either black or white.Two cells are considered neighbours if they have a common border...原创 2019-03-19 20:58:22 · 184 阅读 · 0 评论 -
【计蒜客 - 蓝桥训练】蒜厂年会(循环数列的最大子段和)
题干:在蒜厂年会上有一个抽奖,在一个环形的桌子上,有nn个纸团,每个纸团上写一个数字,表示你可以获得多少蒜币。但是这个游戏比较坑,里面竟然有负数,表示你要支付多少蒜币。因为这些数字都是可见的,所以大家都是不会出现的赔的情况。游戏规则:每人只能抓一次,只能抓取一段连续的纸团,所有纸团上的数字和就是你可以获得的蒜币。蒜头君作为蒜厂的一员在想,我怎么可以获得最多的蒜币呢?最多能获取多少蒜...原创 2019-03-23 11:33:53 · 283 阅读 · 0 评论 -
ZOJ - 4114 第十届山东省赛 - B - Flipping Game(DP)
sample input33 2 10011003 1 20011003 3 2001100sample output217hintFor the first sample test case, Little Sub can press the 1st switch in the 1st round and the 3rd switch in the 2nd ...原创 2019-05-25 10:49:33 · 183 阅读 · 0 评论 -
HDU3496 Watch The Movie 二维01背包
题目链接New semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. She like watch cartoon very much. So she wants her uncle to b...原创 2019-08-09 21:27:02 · 338 阅读 · 0 评论 -
2019年我能变强组队训练赛第二场(补题场) K Pakage 二维01背包
题目描述It was bound to happen. Modernisation has reached the North Pole. Faced with escalating costs for feeding Santa Claus and the reindeer, and serious difficulties with security, NP Management has...原创 2019-08-10 10:41:10 · 245 阅读 · 0 评论 -
2019牛客暑期多校训练营(第七场)H Pair 数位dp
题目链接题意:给你A,B,C,三个数其中1<=x<=A,1<=y<=B,要你判断有多少对x,y是满足:(x and y) >C(x xor y) <C满足上述的任意一个即可;分析:数位dp,这里直接球满足题意的有点麻烦,不妨我们球不满足题意的,这样就用所有的组合情况减去不满足题意的就好了;定义dp[pos][i][j][k][l]为...原创 2019-08-15 11:07:39 · 260 阅读 · 0 评论 -
2018 宁夏邀请赛 F Moving On
Moving OnFirdaws and Fatinah are living in a country with nn cities, numbered from 11 to nn.Each city has a risk of kidnapping or robbery.Firdaws’s home locates in the city uu, and Fatinah’s home lo...原创 2019-09-01 10:15:43 · 320 阅读 · 3 评论 -
POJ-1015 背包变形+输出选择
In Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is set to begin, a jury has to be selected, which ...原创 2018-09-15 11:58:24 · 342 阅读 · 0 评论 -
HDU -1160 最长上升子序列变形+输出任意一组元素
FatMouse 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 possible into a sequence...原创 2018-09-14 21:25:16 · 170 阅读 · 0 评论 -
POJ 3181 组合数+大数的处理
Dollar Dayz POJ - 3181 Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and ...原创 2018-09-19 21:24:53 · 248 阅读 · 0 评论 -
poj 2385(经典DP 01背包 两种初始情况要处理的情况 )
Apple CatchingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14701 Accepted: 7198DescriptionIt is a little known fact that cows love apples. Farmer John has two apple trees (which are conve...原创 2018-06-27 17:06:01 · 163 阅读 · 0 评论 -
poj 3280(区间DP)
Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12396 Accepted: 5873DescriptionKeeping track of all the cows can be a tricky task so Farmer John has installed a system to ...原创 2018-07-02 18:20:25 · 202 阅读 · 0 评论 -
poj 3616(DP之最长上升子序列(区间区间))
Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13113 Accepted: 5541DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that s...原创 2018-06-30 20:19:14 · 715 阅读 · 0 评论 -
yoj 01背包(输出选择的序号)
2335: 0-1背包问题Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 98 Solved: 61[Submit][Status][Web Board]Description 试设计一个用回溯法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数,并将此函数用于解0-1背包问题。 0-1 背包问题描述如下:...原创 2018-06-19 10:29:00 · 632 阅读 · 0 评论 -
poj 1384(DP之完全背包)
Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple...原创 2018-06-17 14:42:13 · 518 阅读 · 0 评论 -
POJ 1742(DP之多重部分和问题)
CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 41899 Accepted: 14191DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony open...原创 2018-06-16 12:21:44 · 187 阅读 · 0 评论 -
POJ 1745
Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us,...原创 2018-06-14 12:27:06 · 209 阅读 · 0 评论 -
poj 2229(DP)
SumsetsTime Limit: 2000MS Memory Limit: 200000KTotal Submissions: 22646 Accepted: 8681DescriptionFarmer John commanded his cows to search for different sets of numbers that sum to a given number. The ...原创 2018-06-21 17:31:51 · 128 阅读 · 0 评论 -
poj 3046(多重集组合数)+滚动数组的优化
Ant CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7172 Accepted: 2641DescriptionBessie was poking around the ant hill one day watching the ants march to and fro while gathering foo...原创 2018-07-05 19:40:50 · 236 阅读 · 0 评论 -
数位DP HDU 2089
杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。 不吉利的数字为所有含有4或62的号码。例如: 62315 73418 88914 都属于不吉利号码。但是,61152虽然含有6和2,但不是62连号,所以不属于不吉利数字之...原创 2018-08-06 16:30:54 · 94 阅读 · 0 评论 -
POJ 3666 DP+滚动数组的优化+滚动数组的优化
Making the GradeA 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 fon...原创 2018-09-18 18:45:25 · 147 阅读 · 0 评论 -
HDU 1069 堆叠箱子
Monkey and BananaA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some ...原创 2018-09-07 17:09:34 · 442 阅读 · 0 评论 -
HDU 1078 dfs+dp之记忆化搜索的体现
FatMouse and CheeseFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q &l...原创 2018-09-16 20:58:45 · 175 阅读 · 0 评论 -
POJ 1952 求最长下降子序列的长度和个数
The advice to "buy low" is half the formula to success in the bovine stock market.To be considered a great investor you must also follow this problems' advice: "Buy low; buy low...原创 2018-09-09 11:40:31 · 1574 阅读 · 0 评论 -
HDU 1024 基础DP+滚动数组
Max Sum Plus Plus题目大意:给你两个数M和N,之后是N个数,从这N个数找到M个子段,求M个子段的最大和;在不考虑数量级的情况下,求最优解,DP出场,在这里,我们设dp[i][j]表示前j个数中分成i段的最大和,然后可以得出dp[i][j]=max(dp[i][j-1],dp[i-1][k])+a[j];(i-1<=k<=j-1)这是有两层含义,首先max...原创 2018-09-05 21:05:35 · 182 阅读 · 0 评论 -
HDU1257 最少拦截系统 (最长上升子序列Dilworth定理/贪心)
某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹. 怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一下最少需要多少套拦截系统...原创 2018-09-07 20:04:35 · 689 阅读 · 0 评论 -
数位DP
在了解数位dp之前,先来看一个问题: 例1.求a~b中不包含49的数的个数. 0 < a、b < 2*10^9注意到n的数据范围非常大,暴力求解是不可能的,考虑dp,如果直接记录下数字,数组会开不起,该怎么办呢?要用到数位dp. 数位dp一般应用于: 求出在给定区间[A,B]内,符合条件P(i)的数i的个数. 条件P(i)一般与数的大小无关,而...原创 2018-08-06 15:28:51 · 2234 阅读 · 0 评论 -
poj 3254 简单入门状压DP
Corn FieldsTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 19670 Accepted: 10318 DescriptionFarmer John has purchased a lush new rectangular pasture composed of M by...原创 2018-08-08 14:53:51 · 119 阅读 · 0 评论