- 博客(14)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 SDUT3333&3332 下一较大值
Problem Description 对于包含n（1<=n<=100000）个整数的序列，对于序列中的每一元素，在序列中查找其位置之后第一个大于它的值，如果找到，输出所找到的值，否则，输出-1。Input 输入有多组，第一行输入t（1<=t<=10），表示输入的组数； 以后是 t 组输入：每组先输入n，表示本组序列的元素个数，之后依次输入本组的n个元素。Output 输出有多
2017-09-25 18:12:13
637
原创 SDUT2132--一般算术表达式转换成后缀式
Problem Description 对于一个基于二元运算符的算术表达式，转换为对应的后缀式，并输出之。input 输入一个算术表达式，以‘#’字符作为结束标志。Output 输出该表达式转换所得到的后缀式。Example Input a*b+(c-d/e)*f#Example Output ab*cde/-f*+思路 栈的基本运算。 两个栈，一个存放运算符，另一
2017-09-15 13:16:11
672
原创 2017 ACM/ICPC Asia Regional Shenyang Online 1004 array array array
Problem Description One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan blocked Kiddo’s path to escape from the museum. But Kiddo didn’t want to give it back. So, Kiddo ask
2017-09-10 19:58:06
982
原创 2017 ACM/ICPC Asia Regional Shenyang Online
2017 ACM/ICPC Asia Regional Shenyang Online1004
2017-09-10 12:04:03
1836
原创 2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 C. Coconut（签到）
C: Coconut time limit 200ms memory limit 131072KBDiscussion Coconut is Captain Gangplank’s favourite fruit. That is why he needs to drink coconut juice from b coconuts each
2017-09-10 10:35:08
1038
原创 2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 A. Banana（签到）
A: Banana time limit 200ms memory limit 131072KBDiscussion Bananas are the favoured food of monkeys. In the forest, there is a Banana Company that provides bananas from different
2017-09-10 10:08:59
782
原创 2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛
2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛A题 ： BananaC题 ： Coconut
2017-09-09 12:17:26
3914
原创 顺序表基本运算算法
//顺序表基本运算算法#include <stdio.h>#include <malloc.h>#define MaxSize 50typedef int ElemType; typedef struct { ElemType data[MaxSize]; //存放顺序表元素 int length; //存放顺序表的长度} SqLis
2017-09-08 17:53:41
4983
3
原创 POJ1573--Robot Motion（模拟）
Description A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are
2017-09-04 17:59:35
378
原创 POJ2632--Crashing Robots（模拟）
Description In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each other. Of course, a
2017-09-03 21:18:24
378
原创 POJ3295--Tautology(模拟)
Description WFF ‘N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any str
2017-09-03 18:19:56
374
原创 一些自己不会的小函数用法
1 大小写转换char ch;ch = toupper('a'); // ch 就为 Achar ch;ch = tolower('A'); // ch 就为 a
2017-09-03 13:57:59
282
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人