- 博客(38)
- 资源 (22)
- 收藏
- 关注
RSS订阅原创 FATE hdu 二维费用背包
FATE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5896 Accepted Submission(s): 2716
2013-08-27 20:11:15
738
转载 【DP_背包专辑】 学车好痛苦~
这短时间看了论文《背包九讲》，看到背包问题解法中的优美之处也看到背包问题在现实中的应用，总结出一句话：背包问题值得一看。 背包问题可以概括为这样的模型：有若干种选择，每种选择有一定的代价和价值，做某些选择会得到特定的状态，问我们在约定的条件下怎么得到特定的状态？这里的状态可以是代价和或者价值和或者由其他这两者组合而来的状态。这类问题需要枚举每种状态，但是可以通过动态规划减少枚举的次数
2013-08-23 22:35:54
747
原创 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活{ 多重背包} （题目真长啊啊啊啊~）
悼念512汶川大地震遇难同胞——珍惜现在，感恩生活 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10785 Accepted Submission(s): 4565
2013-08-13 11:46:20
1007
原创 Big Event in HDU 多重背包~
Big Event in HDU Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18762 Accepted Submission(s): 6566
2013-08-13 11:40:13
542
原创 Investment poj 完全背包
InvestmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6874 Accepted: 2385DescriptionJohn never knew he had a grand-uncle, until he received the nota
2013-08-13 11:20:40
661
原创 最大报销额 hdu 01背包
最大报销额 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13443 Accepted Submission(s): 3737
2013-08-12 20:25:58
813
原创 Robberies hdu 01 背包
Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8082 Accepted Submission(s): 3058Problem Descriptio
2013-08-12 20:21:12
712
原创 hdu I NEED A OFFER! 01 背包
I NEED A OFFER! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12816 Accepted Submission(s)
2013-08-12 20:06:13
597
原创 Bone Collector 01背包
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21711 Accepted Submission(s): 8752P
2013-08-12 19:55:31
729
原创 Charm Bracelet poj 01 背包
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17400 Accepted: 7901DescriptionBessie has gone to the mall's jewelry store and spies a
2013-08-12 18:57:21
624
原创 BUY LOW, BUY LOWER poj
BUY LOW, BUY LOWERDescriptionThe 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:
2013-08-11 19:21:16
760
原创 acmclub 周赛~
问题 A : 购物停车时间限制：1 秒内存限制：32 兆特殊判题： 否提交：53解决： 42题目描述小明每周都要开车陪女朋友去商业街购物，商业街是一条笔直的大街，我们把它抽象成是X轴上的一条线段，街上的每个商铺都位于线段上整数点的位置，而顾客可以在线段上的任何一个位置停车，并且每停一次车都需要交一次费用。于是小明想知道如果自己就停
2013-08-11 17:53:26
1671
原创 hdu Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 176
2013-08-11 16:28:42
561
原创 1916:合唱队形
1916:合唱队形分数: 4时间限制：1 秒内存限制：32 兆特殊判题： 否提交：2解决： 2题目描述N位同学站成一排，音乐老师要请其中的(N-K)位同学出列，使得剩下的K位同学不交换位置就能排成合唱队形。合唱队形是指这样的一种队形：设K位同学从左到右依次编号为1, 2, …, K，他们的身高分别为T1, T2, …,
2013-08-11 16:21:24
799
原创 Common Subsequence 最长公共子序列 hdu 1159
Common Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17709 Accepted Submission(s): 7445Problem Descrip
2013-08-09 20:04:48
762
2
原创 最大连续子序列 hdu 1231
最大连续子序列 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15559 Accepted Submission(s): 6818Problem Descripti
2013-08-09 15:45:54
696
原创 免费馅饼 hdu 1176
免费馅饼 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19705 Accepted Submission(s): 6586Problem Descripti
2013-08-09 15:22:50
544
原创 hdu 2084
数塔 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15990 Accepted Submission(s): 9566Problem Description在讲述D
2013-08-09 11:40:21
584
转载 动态规划法
八、动态规划法 经常会遇到复杂问题不能简单地分解成几个子问题，而会分解出一系列的子问题。简单地采用把大问题分解成子问题，并综合子问题的解导出大问题的解的方法，问题求解耗时会按问题规模呈幂级数增加。 为了节约重复求相同子问题的时间，引入一个数组，不管它们是否对最终解有用，把所有子问题的解存于该数组中，这就是动态规划法所采用的基本方法。以下先用实例说明动态规划方法的使用。
2013-08-08 20:32:34
1343
原创 dfs总结
dfs总结深搜dfs 排列组合时要注意是否是要字典序进行输出 如果是 则需要在dfs前先进行排序 同时 在搜索方向时 要以前一个搜索最后一个结点为下一个搜索的起点 这样就不会重复了~对于一些矩形或者图形的搜索，如果是以下标开始计数（cur) 当cur走到最大值即（n*M）时 可省去for循环 x=cur%n,y=cur/n;数据量大 或者有重复数据时要注意
2013-08-08 19:19:32
1204
原创 Sum of Factorials zoj
Sum of FactorialsTime Limit: 2 Seconds Memory Limit: 65536 KB John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American mathematician who made important contributions t
2013-08-08 19:18:02
1345
原创 Farm Irrigation zoj
Farm IrrigationTime Limit: 2 Seconds Memory Limit: 65536 KB Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipe
2013-08-08 19:02:59
708
原创 Securing the Barn poj
Securing the BarnTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1860 Accepted: 1191DescriptionFarmer John has installed a new security system on the ba
2013-08-08 11:07:43
1113
原创 zoj Exchange Cards
Exchange CardsTime Limit: 2 Seconds Memory Limit: 65536 KB As a basketball fan, Mike is also fond of collecting basketball player cards. But as a student, he can not always get the money t
2013-08-08 10:41:35
944
原创 Gnome Tetravex zoj
Gnome TetravexTime Limit: 10 Seconds Memory Limit: 32768 KB Hart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is given n
2013-08-07 23:44:43
808
原创 Sum It Up poj 1711
Sum It UpTime Limit: 2 Seconds Memory Limit: 65536 KB Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if
2013-08-07 16:48:25
735
转载 刘汝佳黑书 pku等oj题目
一.动态规划参考资料：刘汝佳《算法艺术与信息学竞赛》《算法导论》推荐题目：http://acm.pku.edu.cn/JudgeOnline/problem?id=1141 简单http://acm.pku.edu.cn/JudgeOnline/problem?id=2288 中等，经典TSP问题http://acm.pku.edu.cn/Judge
2013-08-06 10:37:34
821
原创 hdu 1028 整数划分
Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9937 Accepted Submission
2013-08-05 21:34:36
638
原创 poj 1321 棋盘问题
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18683 Accepted: 9276Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解
2013-08-05 16:37:55
630
原创 zoj 1002 Fire Net
Fire NetTime Limit: 2 Seconds Memory Limit: 65536 KB Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representin
2013-08-05 12:13:33
692
原创 N皇后问题 hdu 2553
N皇后问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5729 Accepted Submission(s): 2596Problem Description在N*
2013-08-04 22:29:41
859
原创 poj LETTERS 1154
LETTERSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5601 Accepted: 2661DescriptionA single-player game is played on a rectangular board divided in R ro
2013-08-04 16:30:32
1195
原创 Lotto zoj 1089
LottoTime Limit: 2 Seconds Memory Limit: 65536 KB In a Lotto I have ever played, one has to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn
2013-08-04 15:03:09
760
原创 Seeding zoj
SeedingTime Limit: 2 Seconds Memory Limit: 65536 KB It is spring time and farmers have to plant seeds in the field. Tom has a nice field, which is a rectangle with n * m squares. There are b
2013-08-04 10:40:26
826
原创 poj 2312 Battle City bfs +优先队列
Battle CityTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6496 Accepted: 2176DescriptionMany of us had played the game "Battle city" in our childhood,
2013-08-03 20:30:22
805
转载 优先队列
优先队列在优先队列中，优先级高的元素先出队列。标准库默认使用元素类型的操作符来确定它们之间的优先级关系。优先队列的第一种用法，也是最常用的用法：priority_queueint> qi;通过操作符可知在整数中元素大的优先级高。故示例1中输出结果为：9 6 5 3 2第二种方法：在示例1中，如果我们要把元素从小到大输出怎么办呢？这时我们可以传入一
2013-08-03 17:06:14
546
原创 NYOJ 吝啬的国度
吝啬的国度时间限制：1000 ms | 内存限制：65535 KB难度：3描述在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。输入第一行输入一个整数M表示测试数据共有M(1每组
2013-08-03 16:13:34
805
原创 排列组合 dfs
组合数时间限制：3000 ms | 内存限制：65535 KB难度：3描述找出从自然数1、2、... 、n（0<n<10）中任取r(0<r<=n)个数的所有组合。输入输入n、r。输出按特定顺序输出所有组合。特定顺序：每一个组合中的值从大到小排列，组合之间按逆字典序排列。样例输入5 3样例输出543542541
2013-08-03 10:48:42
1799
2
两个Fragment分别在各自的Activity上的交互
2016-04-05
BLE 串口程序
2014-12-05
编译原理课程设计 增加数据类型 全套资料
2014-07-21
工具资料stl
2012-11-20
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人