- 博客(9)
- 收藏
- 关注
RSS订阅
原创 HDU 5000 Clone
Clone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1438 Accepted Submission(s): 668 Problem Description After eating food from Ch
2016-07-25 09:54:31
319
原创 HDU 4998 Rotate
Rotate Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1116 Accepted Submission(s): 503 Special Judge Problem Description Noting is m
2016-07-25 09:47:31
369
原创 HDU 5001 Walk
Walk Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1049 Accepted Submission(s): 674 Special Judge Problem Description I used to t
2016-07-25 09:44:39
364
原创 HDU 5289
Assignment Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3478 Accepted Submission(s): 1605 Problem Description Tom owns a company
2016-07-20 20:28:52
398
原创 L3-011. 直捣黄龙
L3-011. 直捣黄龙 时间限制 150 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 陈越 本题是一部战争大片 —— 你需要从己方大本营出发，一路攻城略地杀到敌方大本营。首先时间就是生命，所以你必须选择合适的路径，以最快的速度占领敌方大本营。当这样的路
2016-07-18 21:45:11
1545
原创 HDU 5256 序列变换
序列变换 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1257 Accepted Submission(s): 472 Problem Description 我们有一个数列A1,A2...An，你现在要求修改数
2016-07-18 19:01:25
467
原创 pat 5-7 Complete Binary Search Tree (30分)
5-7 Complete Binary Search Tree (30分) A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with
2016-07-04 11:10:54
538
原创 PAT 堆中的路径 (25分)
2-3 堆中的路径 (25分) 将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i，打印从H[i]到根结点的路径。 输入格式: 每组测试第1行包含2个正整数NN和MM(\le 1000≤1000)，分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的NN个要被插入一个初始为空的小顶堆的整数。最后一行给出MM
2016-07-04 10:53:16
2314
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人