source:http://soj.sysu.edu.cn/show_problem.php?pid=1005&cid=2390题意给出一个序列，找出满足下列条件的数的数目： 1.这个数它比左边的数都大 2.这个数比它右边的数都小算法最简单的方法就是写两个函数，返回...
source:http://soj.sysu.edu.cn/show_problem.php?pid=1005&cid=2390题意给出一个序列，找出满足下列条件的数的数目： 1.这个数它比左边的数都大 2.这个数比它右边的数都小算法最简单的方法就是写两个函数，返回...
这个 /* * main.cpp * * Created on: 2014年9月23日 * Author: xiangxiyun */ #include #include #include using namespace std; struct period { double begin, end;...
1150. 简单魔板 Constraints Time Limit: 1 secs, Memory Limit: 32 MB , Special Judge Description 魔板由8个大小相同方块组成，分别用涂上不同颜色，用1到8的数字表示。 其初始状态是 ...1
1561. PRIME 限制条件 时间限制: 1 秒, 内存限制: 32 兆 题目描述 A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. The first prime ...
Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Lenny likes to play the game of lotto. In the lotto game, he picks a list of N unique numbers in the range from 1 to M....
使用优先队列实现 #include #include using namespace std; int main() { int caseNum; cin >> caseNum; while(caseNum--) { priority_queue, greater > q;//优先队列，优先级高的先pop ... for(int i = 0
1006. Team Rankings Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description It's preseason and the local newspaper wants to publish a preseason ranking of the teams in the local amateur
声明：原题目转载自中山大学sicily平台，解答部分为原创 Problem ： 定义超级和函数F如下： F(0, n) = n，对于所有的正整数n.. F(k, n) = F(k – 1, 1) + F(k – 1, 2) + … + F(k – 1, n)，对于所有...
Description Several surveys indicate that the taller you are, the higher you can climb the corporate ladder. At TALL Enterprises Inc....facto standard" has been properly formalized: your boss
• 深度搜索。 • 思路很明确：通过给出的数据构建出如题所示的图，然后以一个结点为种子进行深搜。 • 我使用一个二维数组（mark）来表示这个图，使用一个一维数组（num）来记录每个结点对应的值；...
1926. 测试题 Constraints Time Limit: 1 secs, Memory Limit: 32 MB , Framework Judge Description 请完成一下类的定义和实现。不需要包含主函数 class NumCal { int *p;...
简单，详细，易懂，仅用数组完成
排序，字符串前缀处理 排序，字符串前缀处理
这道题也算是一道简单题，但是因为我太水，以至于提交了很多次菜
1133. SPAM Constraints Time Limit: 10 secs, Memory Limit: 32 MB Description You never had any friends, and don't really want any anyways, and so you have decided to collect email addresses from
Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description 在Mars星球上，每个Mars人都随身佩带着一串能量项链。在项链上有N颗能量珠。能量珠是一颗有头标记与尾标记的珠子，这些标记对应着某个正...
Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description The new general manager Gill Bates has been to a seminar on time management. Ever since she has been bothering all of her staff to
这道题题意如下 有一个长度为n的打印任务队列，每个任务有优先级 每次从队列头得到一个任务，如果它是剩余任务中优先级最高的，则打印它，否则放到队列尾 问其中某个任务是第几个被打印的。 n ≤ ...
相遇理解为直接穿过。 #include #include #include using namespace std; struct person { int f,b; }p[1005]; bool cmp(struct person a,struct person b) { return a.f;... scanf("%d",&
1029. Rabbit Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description The rabbits have powerful reproduction ability. One pair of adult rabbits can give birth to one pair of kid rabbits e
1212. 建立航道 Constraints Time Limit: 1 secs, Memory Limit: 32 MB ...公元XXXX年，XX系的n个星球即将结盟，联盟决定在星球间建立若干条超光速运输航道，以便使任两个星球间都可以直接或间接通过超光速航道...
Sicily 1029 忘记了怎么做，于是问了度娘，在一个人的空间里看一个方法然后自己也写了一下。附上网址http://bbs.csdn.net/topics/390533413 感谢作者的分享～ 判断 i // Copyright [2014] // Sicily ...
Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description N couples are standing in a circle, numbered consecutively clockwise from 1 to 2N. Husband and wife do not always stand together....
1444. Prime Path Constraints Time Limit: 1 secs, Memory Limit: 32 MB ...The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they
1149. 等价表达式 Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description 明明进了中学之后，学到了代数表达式。有一天，他碰到一个很麻烦的选择题。这个题目的题干中首先给出了一个代数表达式，...
1710. Painted Calculator Constraints Time Limit: 5 secs, Memory Limit: 32 MB Description Patrick has a four function calculator; unfortunately his sister has decided to be a traditio
一、题目描述Given a polynomial and the value of the variable x, you task is to calculate the value of the polynomial.二、输入The first line of the input is a positive integer T. T is the number of ...
做Sicily 1215脱离地牢 这一题，一直Restrict function，都快崩溃了。 最后发现是内存泄露，就是new出来的东西没有及时delete导致的。 具体是在广度优先搜索的时候，每找一次邻居就new出一些节点，有些...
#include #include #include using namespace std; struct child{ int hand; int need; bool operator<(const child & one)const { if(need ) return true;
区间统计 题意: 两个人是好朋友的话,要满足下面的条件 条件:1.她们的排名相差不超过k 2....按排名输入n个人的名字,问有多少对好朋友 数据范围: ...暴力的话,复杂度是O(nk)....我们维护一个大小为20的长度数组,数组第x个元素...