- 博客(14)
- 收藏
- 关注
原创 poj-3869 Headshot
HeadshotTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 303 Accepted: 159DescriptionYou have a revolver gun with a cylinder that has n chambers. Chamber
2013-08-14 16:29:33 583
原创 Business Center
B - Business CenterTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInternational Cyber Police Corporation (ICPC) had built a n
2013-08-14 16:19:20 1049
原创 poj-1579 Function Run Fun
Function Run FunTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14811 Accepted: 7656DescriptionWe all love recursion! Don't we? Consider a three-par
2013-08-08 16:59:03 418
原创 Shiro? Kuro?
Shiro? Kuro?Time Limit: 5 Seconds Memory Limit: 65536 KBShikieiki Yamaxanadu (四季映姫・ヤマザナドゥ) is one of the gods that resides in hell and judges the deceased. She can clearly judge anything
2013-08-08 10:15:50 3298
原创 Yuyuko and Youmu
Yuyuko and YoumuTime Limit: 10 Seconds Memory Limit: 65536 KBSaigyouji Yuyuko (西行寺幽々子), the ghost from the calamitous nirvana, is the princess of Hakugyokurou (白玉楼) in the Netherworld, wh
2013-08-08 10:11:26 783
原创 Bone Collector
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 401 Accepted Submission(s): 53Problem DescriptionMany years ago
2013-08-07 10:10:52 422
转载 01背包问题
本文转自http://www.cnblogs.com/jiangjun/archive/2012/05/08/2489590.html1.递归思想0- 1 背包问题如果采用递归算法来描述则非常清楚明白, 它的算法根本思想是假设用布尔函数knap( s, n) 表示n 件物品放入可容质量为s 的背包中是否有解( 当knap 函数的值为真时说明问题有解,其值为假时无解)
2013-08-05 11:08:23 397
原创 poj2533 Longest Ordered Subsequence
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 28162 Accepted: 12215DescriptionA numeric sequence of ai is ordered if a1 a2
2013-08-01 15:56:19 409
转载 LIS 最长上升子序列N^2以及nlogn算法
本文转自 http://blog.csdn.net/mtttt/article/details/5744431 这题目是经典的DP题目,也可叫作LIS(Longest Increasing Subsequence)最长上升子序列 或者 最长不下降子序列。很基础的题目,有两种算法,复杂度分别为O(n*logn)和O(n^2) 。A.O(n^2)算法分析如下: (a[1
2013-08-01 15:53:26 647
原创 poj 1163 The Triangle
The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33657 Accepted: 19980Description73 88 1 02 7 4 44 5 2 6 5(Figure
2013-08-01 14:49:57 392
原创 poj 1458 hdoj 1159 Common Subsequence
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17510 Accepted Submission(s): 7346Problem DescriptionA subs
2013-08-01 13:55:35 458
原创 fzu训练赛14 I - Prime Substring
I - Prime SubstringTime Limit:2000MS Memory Limit:0KB 64bit IO Format:%lld & %lluDescriptionProblem IPrime Substring Time Limit: 10 seconds Given a string of digits,
2013-08-01 10:17:48 577
原创 fzu训练赛14 H - Birthdates
H - BirthdatesTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluDescriptionWrite a program to identify the youngest person and the oldest person in a class. Input
2013-08-01 10:09:05 589
原创 poj-3660 cow contest
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6098 Accepted: 3302DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa
2013-08-01 10:03:26 439
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人