优化
zugofn
这个作者很懒,什么都没留下…
展开
-
HDU:2602 Bone Collector(经典01背包)
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51939 Accepted Submission(s): 21876Problem DescriptionMany year原创 2016-08-15 17:38:36 · 214 阅读 · 0 评论 -
HDU:1513 Palindrome(回文字符串+最长公共子序列+滚动数组)
PalindromeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5246 Accepted Submission(s): 1800Problem DescriptionA palindrome is a s原创 2016-08-13 10:53:06 · 358 阅读 · 0 评论 -
HDU:5773 The All-purpose Zero(LIS-n*logn解法+思维+技巧)
The All-purpose ZeroTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1618 Accepted Submission(s): 774Problem Description?? gets an原创 2016-08-13 10:29:37 · 284 阅读 · 0 评论 -
九度OJ:1343 城际公路网(特定情况下的floyd优化)
题目1343:城际公路网时间限制:1 秒内存限制:32 兆特殊判题:否提交:504解决:197题目描述:为了加快城市之间的通行和物资流动速度,A国政府决定在其境内的N个大中型城市之间,增加修建K条公路。已知这N个城市中的任意两个都能相互连通,且已知其最短的路径长度。为了时刻监测修建新路对A国城市的影响,特任命你为观察员,负责在每修建完原创 2016-08-12 16:34:00 · 525 阅读 · 0 评论 -
HDU:4521 小明系列问题——小明序列(LIS-n*logn解法变形+思维+技巧)
小明系列问题——小明序列Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2951 Accepted Submission(s): 924Problem Description 大家都知道小明最喜欢研究跟序列有原创 2016-08-12 09:18:45 · 582 阅读 · 0 评论 -
HDU:5256 序列变换(LIS-n*logn解法+思维+技巧)
序列变换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1349 Accepted Submission(s): 509Problem Description我们有一个数列A1,A2...An,你现在要原创 2016-08-11 17:43:20 · 1060 阅读 · 0 评论 -
HDU:1950 Bridging signals(LIS-n*logn解法+思维)
Bridging signalsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1859 Accepted Submission(s): 1233Problem Description'Oh no, t原创 2016-08-11 16:43:57 · 393 阅读 · 0 评论 -
HDU:1025 Constructing Roads In JGShining's Kingdom(LIS-n*logn解法+思维)
Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23170 Accepted Submission(s): 6619Proble原创 2016-08-11 15:13:19 · 271 阅读 · 0 评论 -
POJ:2533 Longest Ordered Subsequence(LIS-n*logn解法)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 47041 Accepted: 20905DescriptionA numeric sequence of ai is ordered if a1 a2原创 2016-08-11 11:27:51 · 310 阅读 · 0 评论 -
HDU:5748 Bellovin(LIS+打表)
BellovinTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1103 Accepted Submission(s): 498Problem DescriptionPeter has a sequence原创 2016-08-13 11:01:17 · 374 阅读 · 0 评论