ACM - 随笔分类(第7页) - WinterFa1L

HDU 1203 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): 40874 Accepted Submission(s): 162 阅读全文

posted @ 2019-08-30 00:26 WinterFa1L 阅读(247) 评论(0) 推荐(0)

HDU 1176 免费馅饼（动态规划、另类数塔）

摘要：免费馅饼 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 76293 Accepted Submission(s): 26722 Problem 阅读全文

posted @ 2019-08-27 00:10 WinterFa1L 阅读(221) 评论(0) 推荐(0)

HDU 1171 Big Event in HDU （动态规划、01背包）

摘要：Big Event in HDU Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57986 Accepted Submission(s): 1 阅读全文

posted @ 2019-08-22 21:23 WinterFa1L 阅读(145) 评论(0) 推荐(0)

HDU 1160 FatMouse's Speed （动态规划、最长下降子序列）

摘要：FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24573 Accepted Submission(s): 10 阅读全文

posted @ 2019-08-22 11:45 WinterFa1L 阅读(681) 评论(0) 推荐(0)

HDU 1159 Common Subsequence （动态规划、最长公共子序列）

摘要：Common Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55301 Accepted Submission(s): 阅读全文

posted @ 2019-08-22 01:17 WinterFa1L 阅读(118) 评论(0) 推荐(0)

HDU 1114 Piggy-Bank（动态规划、完全背包）

摘要：Piggy-Bank Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42725 Accepted Submission(s): 21075 Pr 阅读全文

posted @ 2019-08-22 00:52 WinterFa1L 阅读(365) 评论(0) 推荐(1)

HDU 1087 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): 59516 Accepted S 阅读全文

posted @ 2019-08-22 00:17 WinterFa1L 阅读(173) 评论(0) 推荐(0)

HDU 2809 God of War （状压DP）

摘要：God of War Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1671 Accepted Submission(s): 647 Probl 阅读全文

posted @ 2019-08-21 02:03 WinterFa1L 阅读(196) 评论(0) 推荐(0)

HDU 2973 YAPTCHA （威尔逊定理）

摘要：YAPTCHA Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1885 Accepted Submission(s): 971 Problem 阅读全文

posted @ 2019-08-19 01:52 WinterFa1L 阅读(157) 评论(0) 推荐(0)

状压DP概念及例题（洛谷 P1896 互不侵犯）

摘要：状压DP 就是状态压缩DP。所谓状态压缩，就是将一些复杂的状态压缩起来，一般来说是压缩为一个二进制数，用01来表示某一元素的状态。比如一排灯泡（5个）我们可以用一串二进制01串来表示他们的状态 11111就是全开 00000就是全关 00001就是只开了第五个 00101就是第三和第五个开了以阅读全文

posted @ 2019-08-15 22:17 WinterFa1L 阅读(433) 评论(0) 推荐(0)

ICPC Asia Nanning 2017 F. The Chosen One （大数、规律、2的k次幂）

摘要：Welcome to the 2017 ACM-ICPC Asia Nanning Regional Contest.Here is a breaking news. Now you have a chance to meet alone with the Asia Director through 阅读全文

posted @ 2019-08-15 17:33 WinterFa1L 阅读(405) 评论(0) 推荐(0)

HDU 1074 Doing Homework (状压DP）

摘要：Doing Homework Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14600 Accepted Submission(s): 7070 阅读全文

posted @ 2019-08-15 01:28 WinterFa1L 阅读(268) 评论(0) 推荐(0)

最长上升（不下降）子序列(LIS) 不同求解方法（动规、贪心）

摘要：给定一个序列，求出它的最长上升子序列或者是最长不下降子序列的长度或者输出这个子序列一、动态规划 O(n^2) 1.求长度首先来讨论最长上升子序列的情况，即子序列是严格上升的假如我们以dp[i]表示以a[i]为结尾的上升子序列的长度那么对于 j (1<=j<i),如果a[j]<a[i]，很显阅读全文

posted @ 2019-08-14 20:23 WinterFa1L 阅读(488) 评论(0) 推荐(0)

HDU 1069 Monkey and Banana （动态规划、上升子序列最大和）

摘要：Monkey and Banana Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24147 Accepted Submission(s): 1 阅读全文

posted @ 2019-08-14 01:07 WinterFa1L 阅读(259) 评论(0) 推荐(0)

PTA 7-20 表达式转换

摘要：转自：https://www.cnblogs.com/yuxiaoba/p/8399934.html 算术表达式有前缀表示法、中缀表示法和后缀表示法等形式。日常使用的算术表达式是采用中缀表示法，即二元运算符位于两个运算数中间。请设计程序将中缀表达式转换为后缀表达式。输入格式: 输入在一行中给出不含阅读全文

posted @ 2019-08-13 10:45 WinterFa1L 阅读(2136) 评论(1) 推荐(0)

HDU 1029 Ignatius and the Princess IV （动态规划、思维）

摘要：Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 51503 Accepted Submi 阅读全文

posted @ 2019-08-12 01:54 WinterFa1L 阅读(242) 评论(0) 推荐(0)

HDU 1024 Max Sum Plus Plus （动态规划、最大m子段和）

摘要：Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44371 Accepted Submission(s): 1 阅读全文

posted @ 2019-08-12 00:53 WinterFa1L 阅读(275) 评论(0) 推荐(0)

HDU 1003 Max Sum (动态规划最大区间和）

摘要：Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 330535 Accepted Submission(s): 78678 Prob 阅读全文

posted @ 2019-08-11 20:41 WinterFa1L 阅读(1742) 评论(0) 推荐(0)

HDU 2100 Lovekey （26进制大数、字符串）

摘要：Lovekey Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10680 Accepted Submission(s): 3470 Proble 阅读全文

posted @ 2019-08-11 17:21 WinterFa1L 阅读(274) 评论(0) 推荐(0)

HDU 1865 1sting （递推、大数）

摘要：1sting Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7573 Accepted Submission(s): 2945 Problem 阅读全文

posted @ 2019-08-11 16:15 WinterFa1L 阅读(179) 评论(0) 推荐(0)

Loading

dyhaohaoxuexi

I love you three thousand

随笔分类 - ACM

公告