上一页 1 2 3 4 5 6 7 8 9 ··· 56 下一页
2013年8月1日
HDU 4632 Palindrome subsequence （区间DP）
摘要： Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 558Accepted Submission(s): 203Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing 阅读全文
posted @ 2013-08-01 23:32 Jack Ge 阅读(1443) 评论(0) 推荐(0)
2013年7月31日
HDU 2208 唉，可爱的小朋友（DFS）
摘要： 唉，可爱的小朋友Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 819Accepted Submission(s): 220Problem Description唉，小朋友是比较麻烦的。在一个幼儿园里，老师要上一节游戏课，有N个小朋友要玩游戏，做游戏时要用小皮球，但是幼儿园里只有M个小皮球，而且有些小朋友不喜欢和一些小朋友在一起玩，而只喜欢和另一些小朋友一起玩，比如傻妞只喜欢和傻瓜，傻根，傻蛋们一起玩，傻根又不喜欢和傻蛋一起玩，傻蛋喜欢和傻子 阅读全文
posted @ 2013-07-31 19:28 Jack Ge 阅读(790) 评论(0) 推荐(0)
2013年7月30日
HDU 4618 Palindrome Sub-Array
摘要： Palindrome Sub-ArrayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 751Accepted Submission(s): 366Problem Description A palindrome sequence is a sequence which is as same as its reversed order. For example, 1 2 3 2 1 is a palindrome sequence, but . 阅读全文
posted @ 2013-07-30 10:41 Jack Ge 阅读(324) 评论(0) 推荐(0)
HDU 4324 Triangle LOVE （拓扑排序）
摘要： Triangle LOVETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1707Accepted Submission(s): 729Problem DescriptionRecently, scientists find that there is love between any of two people. For example, between A and B, if A don’t love B, then B must love 阅读全文
posted @ 2013-07-30 09:18 Jack Ge 阅读(505) 评论(0) 推荐(0)
2013年7月29日
POJ 2442 Sequence
摘要： SequenceTime Limit:6000MSMemory Limit:65536KTotal Submissions:6120Accepted:1897DescriptionGiven m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind of sequences. Then we 阅读全文
posted @ 2013-07-29 16:38 Jack Ge 阅读(416) 评论(0) 推荐(0)
POJ 3253 Fence Repair （哈夫曼树）
摘要： Fence RepairTime Limit:2000MSMemory Limit:65536KTotal Submissions:19660Accepted:6236DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN(1 ≤N≤ 20,000) planks of wood, each having some integer lengthLi(1 ≤Li≤ 50,000) uni 阅读全文
posted @ 2013-07-29 16:00 Jack Ge 阅读(339) 评论(0) 推荐(0)
POJ 1862 Stripies （哈夫曼树）
摘要： StripiesTime Limit:1000MSMemory Limit:30000KTotal Submissions:10263Accepted:4971DescriptionOur chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for an i 阅读全文
posted @ 2013-07-29 15:45 Jack Ge 阅读(1043) 评论(0) 推荐(0)
HDU 1896 Stones （优先队列）
摘要： StonesTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 662Accepted Submission(s): 391Problem DescriptionBecause of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a littl 阅读全文
posted @ 2013-07-29 15:30 Jack Ge 阅读(427) 评论(0) 推荐(0)
HDU 3999 The order of a Tree （先序遍历）
摘要： The order of a TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 835Accepted Submission(s): 453Problem DescriptionAs we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely:1.insert a key k to 阅读全文
posted @ 2013-07-29 14:40 Jack Ge 阅读(1214) 评论(0) 推荐(0)
HDU 1710 Binary Tree Traversals （二叉树遍历）
摘要： Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2442Accepted Submission(s): 1063Problem DescriptionA binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the 阅读全文
posted @ 2013-07-29 14:05 Jack Ge 阅读(3344) 评论(0) 推荐(0)
上一页 1 2 3 4 5 6 7 8 9 ··· 56 下一页