数据结构
文章平均质量分 78
还是太年轻
这个作者很懒,什么都没留下…
展开
-
希尔排序与堆排序
输入n个数,对这n个数升序排列希尔排序;时间复杂度O(n^3/2);#includeusing namespace std;int main(){ intT; cin >> T; while(T--) { intn; cin >> n; inta[100001]; f原创 2017-11-19 14:30:11 · 1096 阅读 · 0 评论 -
“今日头条杯”首届湖北省大学程序设计竞赛(网络同步赛)F. Flower Road(十字链表)
链接:https://www.nowcoder.com/acm/contest/104/E来源:牛客网题目描述 (受限于评测机,此题数据范围与现场赛不一致,请谅解) Once upon a time, there was a beautiful princess named TQM, and a handsome prince named GSS. One day, the pri...原创 2018-05-08 21:24:39 · 292 阅读 · 2 评论 -
codeforce 510C Fox And Names(拓扑排序)
C. Fox And Namestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is going to publish a paper on FOCS (Foxes Operated Computer Systems, pro...原创 2018-04-20 10:26:56 · 158 阅读 · 0 评论 -
牛客练习赛14 E-无向图中的最短距离(bfs+bitset)
链接:https://www.nowcoder.com/acm/contest/82/E来源:牛客网题目描述 有一个n个点的无向图,有m次查询,每次查询给出一些(xi,yi) 令dist(x,y)表示x和y点在图中最短距离,dist(x,x)=0,如果x,y不连通则dist(x,y) = inf 每次查询图中有多少个点v与至少一个这次询问给出的(xi,yi)满足dist(v,xi...原创 2018-04-07 13:31:24 · 496 阅读 · 0 评论 -
ZOJ 4016 Mergeable Stack(栈的数组实现)
Mergeable StackTime Limit: 2 Seconds Memory Limit: 65536 KBGiven initially empty stacks, there are three types of operations:1 s v: Push the value onto the top of the -th stack.2 s: Pop the top...原创 2018-04-09 09:58:27 · 324 阅读 · 0 评论 -
L2-012. 关于堆的判断(堆的判断)
L2-012. 关于堆的判断时间限制400 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越将一系列给定数字顺序插入一个初始为空的小顶堆H[]。随后判断一系列相关命题是否为真。命题分下列几种:“x is the root”:x是根结点;“x and y are siblings”:x和y是兄弟结点;“x is the parent of y”:x是y的父结点;“...原创 2018-03-23 14:19:29 · 684 阅读 · 0 评论 -
计算器(中缀表达式转后缀表达式)
问题 G: 计算(calc)时间限制: 1 Sec 内存限制: 128 MB提交: 8 解决: 3[提交][状态][讨论版]题目描述小明在你的帮助下,破密了Ferrari设的密码门,正要往前走,突然又出现了一个密码门,门上有一个算式,其中只有“(”,“)”,“0-9”,“+”,“-”,“*”,“/”,“^”,求出的值就是密码。小明数学学得不好,还需你帮他的忙。(“/原创 2018-01-23 08:06:55 · 1024 阅读 · 0 评论 -
POJ 2431Expedition(贪心+优先队列)
ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions:19288 Accepted: 5554DescriptionA group of cows grabbed a truck and ventured on an expedition de原创 2018-01-04 14:52:19 · 213 阅读 · 0 评论 -
HDU Stones(优先队列)
StonesTime Limit : 5000/3000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 74 Accepted Submission(s) : 57Font: Times New Roman | Verdana | GeorgiaFon原创 2017-12-17 19:48:46 · 181 阅读 · 0 评论 -
优先队列
#include#include#include#includeusing namespace std;int main(){int N;cin >> N;while (N--){priority_queue, greater> P;int n; cin >> n;for (int i = 0; i {int m; cin >> m;原创 2017-12-08 10:55:36 · 147 阅读 · 0 评论 -
简单计算器
#include#include#include#includechar a[300];int length2;using namespace std;stack P;stack C;int main(){void yunsuan();while (gets_s(a) != NULL){length2 = strlen(a);if (a[原创 2017-12-02 18:14:07 · 190 阅读 · 0 评论 -
CodeForce 981 E Addition on Segments(线段树+bitset优化01背包)
E. Addition on Segmentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGrisha come to a contest and faced the following problem.You are given an a...原创 2018-06-16 19:33:14 · 310 阅读 · 0 评论