![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM动态规划
acmfun
这个作者很懒,什么都没留下…
展开
-
HDU 4788
Hard Disk DriveTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 83 Accepted Submission(s)#include #include #include #include #includ原创 2018-01-30 18:13:15 · 160 阅读 · 0 评论 -
dp小题 2018-1-30
动态规划的两个要素:最优子结构和子问题重叠题意:天天酷跑,给一个2*n的格子,初始时在(2,1)这个点上,每次两种操作从(2,i)移动到(2,i+1)从(2,i)跳起,经过(1,i+1)(1,i+2)跳到(2,i+3)当到达(1,n)或者(2,n)的时候,游戏结束,每个格子上有一个分数,游戏总分数就是经过的格子分数之和,求能获得的分数的最大值原创 2018-01-30 18:27:46 · 121 阅读 · 0 评论 -
Piggy-Bank 2018-1-31
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 The idea behind is simple. Whenever some ACM原创 2018-01-31 12:25:57 · 164 阅读 · 0 评论 -
HDU 4747 2018-1-31
MexTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3615 Accepted Submission(s): 1209Problem DescriptionMex is a function on原创 2018-01-31 16:05:28 · 185 阅读 · 0 评论 -
HDU 4489 2018-1-31
The King’s Ups and DownsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 838 Accepted Submission(s): 598Problem DescriptionThe原创 2018-01-31 23:12:44 · 170 阅读 · 0 评论 -
HDU 4055 2018-1-31
Number StringTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2407 Accepted Submission(s): 1192Problem DescriptionThe signatu原创 2018-01-31 23:13:45 · 127 阅读 · 0 评论 -
HDU1176 2018-2-1
int dp[11][100001]; inline int Max(int a, int b, int c=-1) { if(a < b) a = b; if(a < c) a = c; return a; } int main() { int n, i, j; int t, x; while原创 2018-02-01 11:09:31 · 126 阅读 · 0 评论 -
poj 3624 2018-2-1
#include #include #include #include using namespace std;//数组要设的比给的范围稍大一些int bag[12900];int w[3410];int d[3410];int totalN;int totalW;int main(){ int i,j; scanf("%d",&totalN); s原创 2018-02-01 13:44:36 · 138 阅读 · 0 评论 -
HDU 1203 2018-2-1
Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了原创 2018-02-01 15:27:14 · 153 阅读 · 0 评论 -
01背包,完全背包,多重背包的讨论 2018-2-1
首先,先分清楚这三个背包问题。1.01背包:有n种物品与承重为m的背包。每种物品只有一件,每个物品都有对应的重量weight[i]与价值value[i],求解如何装包使得价值最大。2.完全背包:有n种物品与承重为m的背包。每种物品有无限多件,每个物品都有对应的重量weight[i]与价值value[i],求解如何装包使得价值最大。3.多重背包:有n种物品与承重为m的背包。每原创 2018-02-01 16:24:31 · 148 阅读 · 0 评论 -
HDU 1171 2018-2-1
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46489 Accepted Submission(s): 15956Problem DescriptionNowada原创 2018-02-01 21:01:58 · 100 阅读 · 0 评论 -
HDU 1864 2018-2-1
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28718 Accepted Submission(s): 8828Problem Description现有一笔经费可以报销一定额度的发票。允原创 2018-02-01 21:57:30 · 128 阅读 · 0 评论 -
poj 1837 2018-2-3
Language:DefaultBalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15580 Accepted: 9816DescriptionGigel has a strange "balance" and he wants原创 2018-02-03 13:35:19 · 117 阅读 · 0 评论 -
poj 1088 dp+search+2dlis 2018-2-3
#include#include#include#include#include#include#define INF 0x3f3f3f3f#define N 110using namespace std;int next[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};int len[N][N],a[N][N];int m,n;原创 2018-02-03 13:36:31 · 129 阅读 · 0 评论 -
hdu 1078 (记忆化搜索实现dp)
Problem DescriptionFatMouse 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 < n. At e原创 2018-02-03 13:40:00 · 187 阅读 · 0 评论 -
HDU 1506 单调栈 迭代dp
Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20111 Accepted Submission(s): 6103Problem Descrip原创 2018-02-03 22:28:26 · 155 阅读 · 0 评论 -
hdu 1505 2018-2-3
和1506有点像,但需要处理一下City GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7745 Accepted Submission(s): 3373Problem Descripti原创 2018-02-03 22:33:01 · 117 阅读 · 0 评论 -
POJ 1050 2018-2-4
Language:DefaultTo the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 50475 Accepted: 26735DescriptionGiven a two-dimensional array of posit原创 2018-02-04 09:40:28 · 178 阅读 · 0 评论 -
hdu 2059 2018-2-4
龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21170 Accepted Submission(s): 7780Problem Description据说在很久很久以前,可怜的兔子经历了人生原创 2018-02-04 09:41:55 · 154 阅读 · 0 评论 -
hdu 1074 状压dp 2018-2-4
Problem DescriptionIgnatius 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 i原创 2018-02-04 10:11:19 · 162 阅读 · 0 评论 -
hdu 1503 2018-2-9
Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4066 Accepted Submission(s): 2142Special JudgeProblem DescriptionThe company "...原创 2018-02-09 10:01:45 · 106 阅读 · 0 评论 -
uva 111-History Grading 2018-2-9
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=47using namespace std;int save1[30],save2[30];int dp[30][30];int main(){ int...原创 2018-02-09 10:08:50 · 130 阅读 · 0 评论 -
lcsdp hdu 1159 2018-2-9
要小心栈溢出#define MAX(a,b) ((a)>(b)?(a):(b))using namespace std;char a[1001],b[1001];int f[1000][1000];int re;int main(){ int lena, lenb,i,j,re; while(scanf("%s%s", a,b)!=EOF) { ...原创 2018-02-09 10:12:20 · 117 阅读 · 0 评论 -
HDU 2084 2018-1-28
在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少? Input 输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1 Output 对于每个测试实例,输出可能得到的最大和,每个实例的输出占一行。Sample Input 1 5原创 2018-01-28 20:55:03 · 165 阅读 · 0 评论 -
HDU 2844 2018-1-28
Coins Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17239 Accepted Submission(s): 6821Problem Description Whuacmers use coins.They ha原创 2018-01-28 21:07:13 · 104 阅读 · 0 评论 -
HDU 2955 2018-1-28
Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 27106 Accepted Submission(s): 9990Problem Description The aspiring Roy the Ro原创 2018-01-28 21:13:27 · 101 阅读 · 0 评论 -
lcs回顾 2018-2-4
using namespace std;char s1[1005],s2[1005],s[1005];int a[1005][1005];void LCS(){ int n=strlen(s1); int m=strlen(s2); memset(a,0,sizeof(a)); for(int i=1; i<=n; i++) for(int原创 2018-02-04 21:21:59 · 161 阅读 · 0 评论 -
poj 1651矩阵连乘法回顾 2018-2-4
#define len 105int m[len][len],p[len];int n;bool input(){ int i; if(scanf("%d",&n)==1&&n>0){ for(i=0;i<n;i++) scanf("%d",&p[i]); return true; }原创 2018-02-04 22:46:50 · 172 阅读 · 0 评论 -
钢管切割 2018-2-5
钢管切割原始问题: 某公司生产长钢管,然后一般,会将钢条切断,变成不同长度,然后去售卖。其中有个问题是,不同长度的钢管的售价是不一样的,但是它们并不是完全按照比例来,比如2米的钢管售价要比3米的钢管售价要少,但是并不是2比3的比例。钢管的长度售价表如下: 长度i1 2 3 4 5原创 2018-02-05 15:44:24 · 676 阅读 · 0 评论 -
HDU 1864 2018-1-29
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28615 Accepted Submission(s): 8807Problem Description现有一笔经费可以报销一定额度的发票。允原创 2018-01-29 16:24:21 · 181 阅读 · 0 评论 -
HDU 2602 2018-1-29
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 72078 Accepted Submission(s): 29985Problem DescriptionMany year原创 2018-01-29 16:27:51 · 131 阅读 · 0 评论 -
HDU 2159 2018-1-29
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16453 Accepted Submission(s): 7726Problem Description最近xhd正在玩一款叫做FATE的游戏,原创 2018-01-29 16:34:28 · 100 阅读 · 0 评论 -
coin changing problem 2018-2-5
# include # include # include # include # include # include # include # include # include # include # include using namespace std;static const int mmax = 20;static const原创 2018-02-05 16:50:24 · 209 阅读 · 0 评论 -
HDU 1003 2018-1-29 LIS
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 270830 Accepted Submission(s): 64384Problem DescriptionGiven a sequenc原创 2018-01-29 18:20:29 · 200 阅读 · 0 评论 -
HDU 1087 2018-1-29 LIS2
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44021 Accepted Submission(s): 20389Problem Descri原创 2018-01-29 18:39:47 · 121 阅读 · 0 评论 -
DPL_3_A 最大正方形 2018-2-5
# include # include # include # include # include # include # include # include # include # include # include using namespace std;#define max1 1400int dp[max1][max1], g[max1][max1];int原创 2018-02-05 21:16:23 · 163 阅读 · 0 评论 -
HDU 2050 2018-1-29 递推,公式不好想
折线分割平面Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34664 Accepted Submission(s): 23289Problem Description我们看到过很多直线分割平面的题目,原创 2018-01-29 21:55:56 · 132 阅读 · 0 评论 -
HDU 1503 2018-1-29 LCS Special Judge
Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4035 Accepted Submission(s): 2125Special JudgeProblem Description原创 2018-01-29 18:45:26 · 145 阅读 · 0 评论 -
线段上格点的个数 2018-2-10
给定平面上的两个格点p1=(x1,y1),p2=(x2,y2),线段p1p2上,出两点外一共有几个格点?限制条件:-10^9<=x1,x2,y1,y2<=10^9这个题暴力肯定是不行的,必须要想到答案是gcd(|x1-x2|,|y1-y2|)-1,然后用辗转相除法得解using namespace std; int gcd(int a,int b) { if(...原创 2018-02-10 23:14:14 · 917 阅读 · 0 评论 -
extended euclidean algorithm 双六问题 2018-2-10
using namespace std; int ex_Gcd(int a,int b,int &x,int &y){ if(b == 0){ x = 1; y = 0; return a; } else{ int r = ex_Gcd(b,a%b,x,y); ...原创 2018-02-10 23:55:58 · 329 阅读 · 0 评论