pku
文章平均质量分 79
6个石头
这个作者很懒,什么都没留下…
展开
-
PKU 1207 The 3n + 1 problem
The 3n + 1 problemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46860 Accepted: 14769DescriptionProblems in Computer Science are often classified as bel原创 2013-07-11 16:25:43 · 559 阅读 · 0 评论 -
Who's in the Middle(简单快排)
题目链接:http://poj.org/problem?id=2388题目意思:有一些牛,产了一些奶,找一个中间数,该数钱面的都小,。后面的都大,也即找一个钟位数。简单快排,但要注意结构体排序的写法!代码:#include#includeusing namespace std;typedef struct Node{ int i; int n原创 2014-03-09 15:57:13 · 955 阅读 · 0 评论 -
poj 1258 Agri-Net(简单最小生成树)
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34571 Accepted: 13888DescriptionFarmer John has been elected mayor of his town! One of his cam原创 2013-11-11 20:15:05 · 503 阅读 · 0 评论 -
poj 2387 Til the Cows Come Home
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25791 Accepted: 8677DescriptionBessie is out in the field and wants to get back to原创 2013-11-08 20:15:43 · 447 阅读 · 0 评论 -
字符统计
描述判断一个由a-z这26个字符组成的字符串中哪个字符出现的次数最多输入第1行是测试数据的组数n,每组测试数据占1行,是一个由a-z这26个字符组成的字符串每组测试数据之间有一个空行,每行数据不超过1000个字符且非空输出n行,每行输出对应一个输入。一行输出包括出现次数最多的字符和该字符出现的次数,中间是一个空格。如果有多个字符出现的次数相同且最多,那么输出ascii码原创 2013-10-23 23:22:35 · 1006 阅读 · 0 评论 -
poj 2499 Binary Tree(超简单的二叉树)
Binary TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5628 Accepted: 2623DescriptionBackground Binary trees are a common data structure in comput原创 2013-10-22 22:17:35 · 701 阅读 · 0 评论 -
poj 3984
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6410 Accepted: 3741Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,原创 2013-09-29 13:03:45 · 557 阅读 · 0 评论 -
poj 3626 Mud Puddles (简单BFS)
Mud PuddlesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2743 Accepted: 1607DescriptionFarmer John is leaving his house promptly at 6 AM for his dai原创 2013-10-08 18:24:15 · 910 阅读 · 0 评论 -
poj 3278
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 38813 Accepted: 12098DescriptionFarmer John has been informed of the location of a fugitiv原创 2013-09-13 23:22:06 · 552 阅读 · 0 评论 -
poj 2371 Questions and answers
Questions and answersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9714 Accepted: 5150DescriptionThe database of the Pentagon contains a top-secret info原创 2013-08-27 16:57:17 · 926 阅读 · 0 评论 -
poj 2533 Longest Ordered Subsequence
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 28661 Accepted: 12445DescriptionA numeric sequence of ai is ordered if a1 a2原创 2013-08-25 19:41:13 · 743 阅读 · 0 评论 -
Ultra-QuickSort(归并排序+逆序数)
题目链接:http://poj.org/problem?id=2299题目意思:给你一个离散的数列,然后要排序成有序的序列,但每次只能在相邻的两个之间交换,问你要交换的最小次数。这是简单的归并排序题,给出归并排序的模板:void merge(int low, int mid, int high){ int i,j,k; i=k=low; j原创 2014-03-09 15:49:39 · 2129 阅读 · 1 评论