随笔分类 -  动态规划

【lightoj - 1004 Monkey Banana Problem (简单动规，就是数字三角形嘛。。。不过发现有个小问题)】
摘要：1004 - Monkey Banana ProblemPDF (English)StatisticsForumTime Limit:2 second(s)Memory Limit:32 MBYou are in the world of mathematics to solve the great "Monkey Banana Problem". It states that, a monkey enters into a diamond shaped two dimensional array and can jump in any of the adjacent ce 阅读全文
posted @ 2012-08-09 13:23 ismdeep 阅读(494) 评论(0) 推荐(0)
【hdu - 1069 Monkey and Banana（动态规划，被坑死。一遍AC）】
摘要：Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4087Accepted Submission(s): 2112Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, an 阅读全文
posted @ 2012-08-08 15:12 ismdeep 阅读(269) 评论(0) 推荐(0)
【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): 13056Accepted Submission(s): 5420Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a goo 阅读全文
posted @ 2012-08-08 11:31 ismdeep 阅读(742) 评论(0) 推荐(0)
【ECJTU_ACM 11级队员2012年暑假训练赛（7） - I - Snow】
摘要：I -SnowTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1088DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 23 22 21 813 阅读全文
posted @ 2012-08-05 23:53 ismdeep 阅读(297) 评论(0) 推荐(0)
【hdu - 2571 命运 （动态规划）】ACM程序设计期末考试081230
摘要：命运Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4192Accepted Submission(s): 1482Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却再次面临命运大迷宫的考验，这是魔王lemon设下的又一个机关。要知道，不论何人，若在迷宫中被困1小时以上，则必死无疑！可怜的yifenfei为了去救MM，义无返顾地跳进了迷宫。让我们一起帮帮执 阅读全文
posted @ 2012-07-21 16:23 ismdeep 阅读(337) 评论(0) 推荐(0)
【乘法游戏】
摘要：乘法游戏时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByte总提交:8 测试通过:1描述乘法游戏是在一行牌上进行的。每一张牌包括了一个正整数。在每一个移动中，玩家拿出一张牌，得分是用它的数字乘以它左边和右边的数，所以不允许拿第1张和最后1张牌。最后一次移动后，这里只剩下两张牌。 你的目标是使得分的和最小。 例如，如果数是10 1 50 20 5，依次拿1、20、50，总分是10*1*50+50*20*5+10*50*5=8000 而拿50、20、1，总分是1*50*20+1*20*5+10*1*5=1150。 ... 阅读全文
posted @ 2012-07-21 14:12 ismdeep 阅读(353) 评论(1) 推荐(0)
【poj - 1953 World Cup Noise】
摘要：World Cup NoiseTime Limit:1000MSMemory Limit:30000KTotal Submissions:13155Accepted:6512DescriptionBackground"KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their home country. But although their excitement is real, th 阅读全文
posted @ 2012-07-18 14:48 ismdeep 阅读(213) 评论(0) 推荐(0)
【航线设置 - 动态规划】
摘要：1 // Project name : 航线设置 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : Sun Jul 15 16:33:54 2012 5 6 7 #include <iostream> 8 #include <stdio.h> 9 #include <string>10 #include <cmath>11 #include <algorithm>12 using namespace std;13 14 #define MAXN 1 阅读全文
posted @ 2012-07-15 17:23 ismdeep 阅读(361) 评论(0) 推荐(0)
【游船费问题 - 动态规划】
摘要：1 // Project name : 游船费问题 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : Sat Jul 14 15:21:28 2012 5 6 7 #include <iostream> 8 #include <stdio.h> 9 #include <string>10 #include <cmath>11 #include <algorithm>12 using namespace std;13 14 #define MAXN 阅读全文
posted @ 2012-07-14 16:10 ismdeep 阅读(318) 评论(0) 推荐(0)
【hdu - 2602 Bone Collector（动态规划、01背包）】
摘要：Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12318Accepted Submission(s): 4787Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such 阅读全文
posted @ 2012-07-14 10:42 ismdeep 阅读(171) 评论(0) 推荐(0)
【hdu - 2955 Robberies】
摘要：RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3934Accepted Submission(s): 1492Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because the 阅读全文
posted @ 2012-07-10 10:56 ismdeep 阅读(189) 评论(0) 推荐(0)
【hdu - 1070 Milks】
摘要：MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7951Accepted Submission(s): 1893Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermar 阅读全文
posted @ 2012-07-09 17:14 ismdeep 阅读(186) 评论(0) 推荐(0)
【基础训练题解 -3107 分苹果 】
摘要：1 #include <iostream> 2 #include <cmath> 3 using namespace std; 4 5 int main() 6 { 7 int t; 8 cin >> t; 9 while( t-- )10 {11 int n;12 cin >> n;13 int *a = new int[n];14 int sum = 0;15 16 // input data numbers that everyone own the app... 阅读全文
posted @ 2012-06-04 22:20 ismdeep 阅读(199) 评论(0) 推荐(0)
【基础训练题解 -3101 千年虫引发的麻烦 】
摘要：1 #include <iostream> 2 #include <stdio.h> 3 using namespace std; 4 5 int main() 6 { 7 int s, d; 8 while(scanf("%d%d" ,&s, &d) != EOF) 9 {10 int i;11 for(i = 1; i <= 5; i++)12 {13 if( s * (5-i) - d * i < 0 )14 {15 break;16... 阅读全文
posted @ 2012-06-04 22:19 ismdeep 阅读(371) 评论(0) 推荐(0)
【基础训练题解 -3106 石头剪刀布 】
摘要：1 // project : 3106 2 // file name : main.cpp 3 4 #include <iostream> 5 using namespace std; 6 7 #define SPACE 32 8 9 int main() 10 { 11 int n; 12 while (cin >> n && n) 13 { 14 string str; 15 int s_time, j_time, b_time; 16 17 // input data ... 阅读全文
posted @ 2012-06-04 22:11 ismdeep 阅读(221) 评论(0) 推荐(0)
【hdu - 1058】
摘要：Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8925Accepted Submission(s): 3897Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 阅读全文
posted @ 2012-06-03 20:05 ismdeep 阅读(203) 评论(0) 推荐(0)