01 2016 档案

HOJ 1438 The Tower of Babylon（线性DP）
摘要：The Tower of Babylon My Tags Cancel - Seperate tags with commas. Source : University of Ulm Internal Contest 1996 Time limit : 5 sec M... 阅读全文
posted @ 2016-01-26 20:40 Shendu.CC 阅读(88) 评论(0) 推荐(0) 编辑
HOJ 1444 Humble Numbers
摘要：Humble Numbers My Tags (Edit) Source : University of Ulm Internal Contest 1996 Time limit : 1 sec Memory limit : 32 M Submitted : 578, ... 阅读全文
posted @ 2016-01-26 20:33 Shendu.CC 阅读(134) 评论(0) 推荐(0) 编辑
线性DP总结（LIS,LCS,LCIS，最长子段和）
摘要：做了一段时间的线性dp的题目是时候做一个总结 线性动态规划无非就是在一个数组上搞嘛， 首先看一个最简单的问题： 一，最长字段和 下面为状态转移方程 for(int i=2;i<=n;i++) { if(dp[i-1]>=0) dp[i]=dp[i-1]+a[i]; else dp[i]=a[i]; 阅读全文
posted @ 2016-01-23 23:07 Shendu.CC 阅读(203) 评论(0) 推荐(0) 编辑
单调队列，单调栈总结
摘要：最近几天接触了单调队列，还接触了单调栈，就总结一下。 其实单调队列，和单调栈都是差不多的数据类型，顾名思义就是在栈和队列上加上单调，单调递增或者单调递减。当要入栈或者入队的时候，要和栈头或者队尾进行比较，满足单调的性质则入队入栈，否则将当前元素删去，直到满足单调性质。 那么问题... 阅读全文
posted @ 2016-01-19 23:38 Shendu.CC 阅读(136) 评论(0) 推荐(0) 编辑
HOJ-1005 Fast Food（动态规划）
摘要：Fast Food My Tags (Edit) Source : Unknown Time limit : 3 sec Memory limit : 32 M Submitted : 3777, Accepted : 1147 The fastfood chain M... 阅读全文
posted @ 2016-01-16 22:13 Shendu.CC 阅读(97) 评论(0) 推荐(0) 编辑
POJ-2356 Find a multiple(DFS,抽屉原理)
摘要：Find a multiple Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7133 Accepted: 3122 Special Judge DescriptionThe inpu... 阅读全文
posted @ 2016-01-09 20:10 Shendu.CC 阅读(105) 评论(0) 推荐(0) 编辑
POJ-2346 Lucky tickets（线性DP）
摘要：Lucky tickets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3298 Accepted: 2174 DescriptionThe public transport administ... 阅读全文
posted @ 2016-01-09 20:08 Shendu.CC 阅读(104) 评论(0) 推荐(0) 编辑
POJ-2329 Nearest number - 2（BFS）
摘要：Nearest number - 2 Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 4100 Accepted: 1275 DescriptionInput is the matrix A of... 阅读全文
posted @ 2016-01-09 20:03 Shendu.CC 阅读(93) 评论(0) 推荐(0) 编辑
POJ-2184 Cow Exhibition(01背包变形)
摘要：Cow Exhibition Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10949 Accepted: 4344 Description“Fat and docile, big and... 阅读全文
posted @ 2016-01-09 20:00 Shendu.CC 阅读(110) 评论(0) 推荐(0) 编辑
POJ-2353 Ministry（动态规划）
摘要：Ministry Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4761 Accepted: 1528 Special Judge DescriptionMr. F. wants to... 阅读全文
posted @ 2016-01-09 18:48 Shendu.CC 阅读(167) 评论(0) 推荐(0) 编辑
POJ-2336 Ferry Loading II（简单DP）
摘要：Ferry Loading II Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3763 Accepted: 1919 DescriptionBefore bridges were common... 阅读全文
posted @ 2016-01-09 14:40 Shendu.CC 阅读(134) 评论(0) 推荐(0) 编辑
POJ-2018 Best Cow Fences(二分加DP)
摘要：Best Cow Fences Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 10174 Accepted: 3294 DescriptionFarmer John’s farm cons... 阅读全文
posted @ 2016-01-07 20:23 Shendu.CC 阅读(105) 评论(0) 推荐(0) 编辑
POJ-2039 To and Fro
摘要：To and Fro Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 8694 Accepted: 5847 DescriptionMo and Larry have devised a way ... 阅读全文
posted @ 2016-01-07 20:03 Shendu.CC 阅读(86) 评论(0) 推荐(0) 编辑
POJ-2029 Get Many Persimmon Trees（动态规划）
摘要：Get Many Persimmon Trees Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3987 Accepted: 2599 DescriptionSeiji Hayashi had ... 阅读全文
posted @ 2016-01-07 20:01 Shendu.CC 阅读(106) 评论(0) 推荐(0) 编辑
POJ-2081 Recaman's Sequence
摘要：Recaman’s Sequence Time Limit: 3000MS Memory Limit: 60000K Total Submissions: 22392 Accepted: 9614 DescriptionThe Recaman’s sequen... 阅读全文
posted @ 2016-01-07 19:59 Shendu.CC 阅读(100) 评论(0) 推荐(0) 编辑
POJ-2081 Terrible Sets（暴力，单调栈）
摘要：Terrible Sets Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4113 Accepted: 2122 DescriptionLet N be the set of all natur... 阅读全文
posted @ 2016-01-07 19:58 Shendu.CC 阅读(95) 评论(0) 推荐(0) 编辑
POJ-2181 Jumping Cows（贪心）
摘要：Jumping Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7329 Accepted: 4404 DescriptionFarmer John’s cows would like ... 阅读全文
posted @ 2016-01-07 19:53 Shendu.CC 阅读(150) 评论(0) 推荐(0) 编辑
poj-1989 The Cow Lineup
摘要：The Cow Lineup Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5587 Accepted: 3311 DescriptionFarmer John’s N cows (1 #inc... 阅读全文
posted @ 2016-01-06 09:46 Shendu.CC 阅读(117) 评论(0) 推荐(0) 编辑
POJ-1975 Median Weight Bead（Floyed）
摘要：Median Weight Bead Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3162 Accepted: 1630 DescriptionThere are N beads which ... 阅读全文
posted @ 2016-01-06 09:44 Shendu.CC 阅读(104) 评论(0) 推荐(0) 编辑
POJ-2777 Count Color（线段树，区间染色问题）
摘要：Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 40510 Accepted: 12215 DescriptionChosen Problem Solving and... 阅读全文
posted @ 2016-01-04 19:49 Shendu.CC 阅读(126) 评论(0) 推荐(0) 编辑
POJ-1952 BUY LOW, BUY LOWER（线性DP）
摘要：BUY LOW, BUY LOWER Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 9244 Accepted: 3226 DescriptionThe advice to “buy low” ... 阅读全文
posted @ 2016-01-04 19:42 Shendu.CC 阅读(133) 评论(0) 推荐(0) 编辑
POJ-1959 Darts
摘要：Darts Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 1286 Accepted: 741 DescriptionBackground Many nations (including Ge... 阅读全文
posted @ 2016-01-04 19:36 Shendu.CC 阅读(110) 评论(0) 推荐(0) 编辑
POJ-1958 Strange Towers of Hanoi(线性动规)
摘要：Strange Towers of Hanoi Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 2677 Accepted: 1741 DescriptionBackground Charlie... 阅读全文
posted @ 2016-01-04 19:35 Shendu.CC 阅读(93) 评论(0) 推荐(0) 编辑
POJ-1953 World Cup Noise（线性动规）
摘要：World Cup Noise Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 16374 Accepted: 8097 DescriptionBackground “KO-RE-A, K... 阅读全文
posted @ 2016-01-04 19:32 Shendu.CC 阅读(127) 评论(0) 推荐(0) 编辑
POJ-1926 Pollution
摘要：Pollution Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4049 Accepted: 1076 DescriptionThe managers of a chemical plant,... 阅读全文
posted @ 2016-01-04 19:29 Shendu.CC 阅读(90) 评论(0) 推荐(0) 编辑
POJ--1936 All in All（水题，暴力即可）
摘要：All in All Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 30543 Accepted: 12723 DescriptionYou have devised a new encr... 阅读全文
posted @ 2016-01-04 08:27 Shendu.CC 阅读(99) 评论(0) 推荐(0) 编辑
POJ--1699 Best Sequence（DP+dfs）
摘要：Best Sequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5543 Accepted: 2188 DescriptionThe twenty-first century is a... 阅读全文
posted @ 2016-01-03 20:29 Shendu.CC 阅读(133) 评论(0) 推荐(0) 编辑
POJ--1690 (Your)((Term)((Project)))（字符串处理）
摘要：(Your)((Term)((Project))) Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3353 Accepted: 1256 DescriptionYou have typed th... 阅读全文
posted @ 2016-01-03 20:24 Shendu.CC 阅读(113) 评论(0) 推荐(0) 编辑
POJ-1887 Testing the CATCHER（dp,最长下降子序列）
摘要：Testing the CATCHER Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 16515 Accepted: 6082 DescriptionA military contract... 阅读全文
posted @ 2016-01-03 19:54 Shendu.CC 阅读(124) 评论(0) 推荐(0) 编辑
树形DP总结，持续更新
摘要：自己做了动态规划的题目已经有了一个月，但是成效甚微，所以来总结一下动态规划，希望自己能够温故知新。这个博客是关于树形dp的，动态规划的一类题目。 首先从最简单的树形DP入手，树形DP顾名思义就是一棵树和动态规划结合起来，我做了7，8题树形DP，目前为止发现树形DP的代码样式... 阅读全文
posted @ 2016-01-03 18:09 Shendu.CC 阅读(204) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示