流水依依

希望朋友们有个好的身体,开开心心工作与学习。

博客园 首页 新随笔 联系 订阅 管理
上一页 1 2 3 4 5 6 7 8 9 ··· 14 下一页

2013年12月1日 #

摘要: XiangqiTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3193Accepted Submission(s): 780Problem DescriptionXiangqi is one of the most popular two-player board games in China. The game represents a battle between two armies with the goal of capturing 阅读全文
posted @ 2013-12-01 17:20 流水依依 阅读(304) 评论(0) 推荐(0) 编辑

2013年11月30日 #

摘要: /*小根堆*/class Heap{ private : int num[1008] ; int N ; public : void push(int) ; int top() ; void pop() ; void up(int) ; void down(int) ; int empty_() ; Heap() ;};Heap::Heap(){ N = 0 ;}int Heap::top(){ return num[1] ;}int Heap::... 阅读全文
posted @ 2013-11-30 12:22 流水依依 阅读(228) 评论(0) 推荐(0) 编辑

2013年11月28日 #

摘要: EightTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10101Accepted Submission(s): 2684Special JudgeProblem DescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is construct 阅读全文
posted @ 2013-11-28 16:46 流水依依 阅读(323) 评论(0) 推荐(0) 编辑

2013年11月24日 #

摘要: Pocket CubeTime Limit:2 Seconds Memory Limit:65536 KBPocket Cube is a 3-D combination puzzle. It is a 2 × 2 × 2 cube, which means it is constructed by 8 mini-cubes. For a combination of 2 × 2 mini-cubes which sharing a whole cube face, you can twist it 90 degrees in clockwise or count 阅读全文
posted @ 2013-11-24 20:08 流水依依 阅读(248) 评论(0) 推荐(0) 编辑

摘要: Josephina and RPGTime Limit:2 Seconds Memory Limit:65536 KB Special JudgeA role-playing game (RPG and sometimes roleplaying game) is a game in which players assume the roles of characters in a fictional setting. Players take responsibility for acting out these roles within a narrative, either throug 阅读全文
posted @ 2013-11-24 15:52 流水依依 阅读(274) 评论(0) 推荐(0) 编辑

摘要: Alice's Print ServiceTime Limit:2 Seconds Memory Limit:65536 KBAlice is providing print service, while the pricing doesn't seem to be reasonable, so people using her print service found some tricks to save money.For example, the price when printing less than 100 pages is 20 cents per page, b 阅读全文
posted @ 2013-11-24 14:45 流水依依 阅读(228) 评论(0) 推荐(0) 编辑

2013年11月19日 #

摘要: 题目1449:确定比赛名次时间限制:1 秒内存限制:128 兆特殊判题:否题目描述:有N个比赛队(1#include #include #include #include #include #include #include #include #include #include #include #include #define Max(a,b) ((a)>(b)?(a):(b))#define Min(a,b) ((a)grid[Max_N] ; int in_degree[Max_N] ; vectororder ; TopOrder(){} ; TopOr... 阅读全文
posted @ 2013-11-19 18:20 流水依依 阅读(276) 评论(0) 推荐(0) 编辑

2013年11月18日 #

摘要: 题目1005:Graduate Admission时间限制:1 秒内存限制:32 兆特殊判题:否题目描述: It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if you could write a program to automate the admission procedure. Each applicant will have to provid 阅读全文
posted @ 2013-11-18 14:46 流水依依 阅读(234) 评论(0) 推荐(0) 编辑

2013年11月17日 #

摘要: Fibonacci TreeTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem Description Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to solve the following problem: Consider a bidirecti.. 阅读全文
posted @ 2013-11-17 19:19 流水依依 阅读(341) 评论(0) 推荐(0) 编辑

2013年11月11日 #

摘要: Problem 2136 取糖果Time Limit: 1000 mSecMemory Limit : 32768 KBProblem Description有N个袋子放成一排,每个袋子里有一定数量的糖果,lzs会随机选择连续的几个袋子,然后拿走这些袋子中包含最多糖果的袋子。现问你,在选择x个袋子的情况下,lzs最坏情况下,也就是最少会拿到多少个糖果?对于x取值为1到n都分别输出答案。Input第一行一个整数T,表示有T组数据。每组数据先输入一行一个整数N(1#include #include #include #include #include #include #include #incl 阅读全文
posted @ 2013-11-11 19:00 流水依依 阅读(390) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 7 8 9 ··· 14 下一页