- 博客(12)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 hdu--3790
最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18738 Accepted Submission(s): 5581Problem Description给你n个点，m条无向边，每条边都有长
2015-10-29 20:58:10
322
原创 hdu--1827
Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2333 Accepted Submission(s): 1092Problem DescriptionTo see a W
2015-10-25 22:02:22
518
原创 简单排列组合
DescriptionA rook is a piece used in the game of chess which is played on a board of square grids. A rook can only move vertically or horizontally from its current position and two rooks attack ea
2015-10-25 17:47:06
626
原创 hdu-1269
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10419 Accepted Submission(s): 4682Problem Description为了训练小希的方向感，Gardon建立了一座大城
2015-10-22 21:26:30
313
原创 poj--1700
Crossing RiverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12274 Accepted: 4647DescriptionA group of N people wishes to go across a river with only o
2015-10-15 21:44:45
287
原创 hdu--114
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16610 Accepted Submission(s): 8383Problem DescriptionBefore ACM can
2015-10-11 20:09:14
325
原创 hdu--2191
悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19980 Accepted Submission(s): 8426Problem Description
2015-10-11 19:53:48
375
原创 hdu-1203
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20823 Accepted Submission(s): 8318Problem DescriptionSpeakless
2015-10-10 21:40:38
468
原创 hdu--2955
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17016 Accepted Submission(s): 6280Problem DescriptionThe aspiring Ro
2015-10-10 21:25:21
242
原创 0-1背包模板
0-1背包问题例：题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。解析：这是最简单的0-1背包问题，特点是：每种物品仅有一件，可以选择放或不放。0-1背包问题的特点：1.只有两种状态2.每种元素的数量为一（有时候某种元素的数量不为一，为n，但可以通过转换成n种数量为一的元素，这样就可
2015-10-10 20:54:22
427
原创 hdu--1709
The BalanceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6821 Accepted Submission(s): 2800Problem DescriptionNow you are asked
2015-10-08 20:28:44
397
原创 母函数的定义
研究以下多项式:(1+a1x)(1+a2x)........(1+anx)=1+(a1+a2+......an)x+(a1a2+a1a3+.......+an-1an)x^2+.........+a1a2...an x^n可以看出：x2项的系数a1a2+a1a3+...+an-1an中所有的项包括n个元素a1，a2，…an中取两个组合的全体；同理：x3项系数包含
2015-10-07 22:31:32
690
wampserver2.5
2016-08-03
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人