- 博客(11)
- 资源 (4)
- 收藏
- 关注
原创 [POJ] 1088 -> 滑雪
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 81342 Accepted: 30344DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升
2015-05-10 11:27:41 542
原创 [POJ] 1579 -> Function Run Fun
Function Run FunTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16896 Accepted: 8721DescriptionWe all love recursion! Don't we? Consider a three-param
2015-05-08 13:27:52 456
原创 [POJ] 1458 -> Common Subsequence
Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41382 Accepted: 16722DescriptionA subsequence of a given sequence is the given sequence
2015-05-08 11:27:46 363
原创 [POJ] 1008 -> 玛雅历
玛雅历Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 69633 Accepted: 21426Description上周末,M.A. Ya教授对古老的玛雅有了一个重大发现。从一个古老的节绳(玛雅人用于记事的工具)中,教授发现玛雅人使用了一个一年有365天的叫
2015-05-05 08:08:38 773
原创 [POJ] 2282 -> The Counting Problem
The Counting ProblemTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3606 Accepted: 1922DescriptionGiven two integers a and b, we write the numbers between
2015-05-04 10:23:32 700
原创 [POJ] 3714 -> Raid
RaidTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8937 Accepted: 2694DescriptionAfter successive failures in the battles against the Union, the Empi
2015-05-03 23:37:21 540
原创 期待为线性时间的选择算法
#include using namespace std;int partion(int* arr, int left, int right){ int i = left, j = right, x = arr[i]; while (i < j){ while (i < j && x <= arr[j]) --j; if (i < j) arr[i++] = arr[j];
2015-05-03 22:42:12 480
原创 [POJ] 2318 -> TOYS
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11355 Accepted: 5469DescriptionCalculate the number of toys that land in each bin of a partitioned toy
2015-05-03 18:45:37 544 1
原创 [POJ] 2299 -> Ultra-QuickSort
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 46284 Accepted: 16842DescriptionIn this problem, you have to analyze a particular sorting a
2015-05-03 15:38:46 394
原创 [POJ] 2084 -> Game of Connections
Game of ConnectionsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7709 Accepted: 3891DescriptionThis is a small but ancient game. You are supposed to wri
2015-05-03 14:03:27 521
原创 [POJ] 1400 -> Complicated Expressions
Complicated ExpressionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1528 Accepted: 492DescriptionThe most important activity of ACM is the GSM network.
2015-05-02 18:59:14 631
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人