![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
hdoj
文章平均质量分 76
恶来_ljz
天道酬勤
展开
-
BFS+DFS(hdu 1044)
Collect More JewelsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4709 Accepted Submission(s): 991Problem DescriptionIt is written原创 2014-11-09 21:55:42 · 536 阅读 · 0 评论 -
母函数 多项式相乘求系数(HDU 1028)
Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given an positive integer N, we define an原创 2014-11-13 09:55:53 · 2393 阅读 · 1 评论 -
卡特兰数(HDU 1023)
卡特兰数又称卡塔兰数,是组合数学中一个常出现在各种计数问题中出现的数列。由以比利时的数学家欧仁·查理·卡塔兰 (1814–1894)命名。卡特兰数前几项为 (OEIS中的数列A000108): 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670,原创 2014-11-13 09:49:21 · 675 阅读 · 0 评论 -
哈夫曼编码(HDU 1053)
哈夫曼树与哈夫曼编码在一般的数据结构的书中,树的那章后面,著者一般都会介绍一下哈夫曼(HUFFMAN)树和哈夫曼编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛,如JPEG中就应用了哈夫曼编码。 首先介绍什么是哈夫曼树。哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。所谓树的带权路径长度,就是树中所有的叶结点的权值乘上其到根结点的 路径长度(若根结点为0层,叶结点到根结点的路径原创 2014-11-15 22:19:31 · 914 阅读 · 0 评论 -
田忌赛马Tian Ji -- The Horse Racing(hdu 1052)
刚开始用二分图的最大匹配,超时了。二分图最大分配代码:#include#include int n;int tian[1005],king[1005];int path[1005][1005];int link[1005];int used[1005]; int dfs(int t){for(int i=0;i{if(used[i]==0原创 2014-11-14 15:55:54 · 579 阅读 · 1 评论 -
贪心(HDU 1055)
Color a TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1120 Accepted Submission(s): 364Problem DescriptionBob is very interest原创 2014-11-21 22:42:11 · 926 阅读 · 0 评论 -
树形DP 或 最小顶点覆盖=最大匹配(双向图)(HDU 1053)
Strategic GameTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5170 Accepted Submission(s): 2377Problem DescriptionBob enjoys play原创 2014-11-16 20:28:41 · 1051 阅读 · 0 评论 -
大数求和(hdu 1047)
Integer InquiryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13201 Accepted Submission(s): 3322Problem DescriptionOne of the firs原创 2014-11-13 09:45:35 · 493 阅读 · 0 评论 -
二分图的最大分配(hdu 1045)
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6538 Accepted Submission(s): 3713Problem DescriptionSuppose that we have a原创 2014-11-11 21:54:04 · 512 阅读 · 0 评论 -
Humble Numbers数论(HDU 1055)
Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18028 Accepted Submission(s): 7845Problem DescriptionA number whose o原创 2014-11-22 22:50:48 · 526 阅读 · 0 评论 -
Delta-wave(HDU 1030)
Delta-wave Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5790 Accepted Submission(s): 2211Problem DescriptionA triangle field is number原创 2014-11-13 09:57:11 · 540 阅读 · 0 评论 -
八数码(hdu 1043)
EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12340 Accepted Submission(s): 3296Special JudgeProblem DescriptionThe 15-puzz原创 2014-11-13 10:00:39 · 569 阅读 · 0 评论 -
搜索(HDU 1026)
Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrinth.原创 2014-11-13 09:54:13 · 444 阅读 · 0 评论 -
最长上升子序列(LIS)(HDU 1025)
假设存在一个序列d[1..9] = 2 1 5 3 6 4 8 9 7,可以看出来它的LIS长度为5。下面一步一步试着找出它。我们定义一个序列B,然后令 i = 1 to 9 逐个考察这个序列。此外,我们用一个变量Len来记录现在最长算到多少了首先,把d[1]有序地放到B里,令B[1] = 2,就是说当只有1一个数字2的时候,长度为1的LIS的最小末尾是2。这时Len=1;然后原创 2014-11-13 09:51:42 · 581 阅读 · 0 评论 -
Leftmost Digit(HDU 1060)
Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13604 Accepted Submission(s): 5228Problem DescriptionGiven a positive原创 2014-11-25 22:42:25 · 615 阅读 · 0 评论 -
Rightmost Digit(HDU 1061)
Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33823 Accepted Submission(s): 12912Problem DescriptionGiven a positi原创 2014-11-26 11:09:04 · 655 阅读 · 0 评论 -
多种背包(HDU 1059)
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17783 Accepted Submission(s): 4985Problem DescriptionMarsha and Bill own a原创 2014-11-25 21:11:51 · 463 阅读 · 0 评论 -
背包问题九讲
P01: 01背包问题题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。基本思路这是最基础的背包问题,特点是:每种物品仅有一件,可以选择放或不放。用子问题定义状态:即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程便是:f[i][v]=max{f[i-1][v],f原创 2014-11-24 22:14:41 · 411 阅读 · 0 评论