- 博客(58)
- 收藏
- 关注
RSS订阅原创 雪花雪花雪花
因为雪花的形状是封闭的环形，所以从任何一个角开始顺时针或逆时针往后记录长度，得到的六元组都代表形状相同的雪花。每行包含 6 个整数，分别代表雪花的六个角的长度（这六个数即为从雪花的随机一个角顺时针或逆时针记录长度得到）。我们称两片雪花形状相同，当且仅当它们各自从某一角开始顺时针或逆时针记录长度，能得到两个相同的六元组。有 N 片雪花，每片雪花由六个角组成，每个角都有长度。求这 N 片雪花中是否存在两片形状相同的雪花。第一行输入一个整数 NN，代表雪花的数量。就是形状相同的雪花。也是形状相同的雪花。
2023-04-14 15:37:36
395
原创 POJ - 1797 Heavy Transportation （求路径上最大权值）
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is neede
2022-07-09 21:37:02
146
原创 PAT-甲级 1119 Pre- and Post-order Traversals （前序+后序 求中序遍历）
1.测试点1如果错误的话，数组大小需要开到100左右即可。一开始开66，错了。2.除测试点1外，全部报格式错误。这个需要在中序遍历输出完后输出一个换行即可。前序和后序 求中序遍历和中序种类...
2022-06-04 16:09:04
207
1
原创 PAT-甲级 1115 Counting Nodes in a Binary Search Tree(BST插入和层序遍历)
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:Insert a sequence of numbers into an initially empty binary search tree. Then you are supposed to count the total number of nodes in the lowest 2 levels o
2022-06-03 22:23:05
193
原创 AVL平衡二叉搜索树 （介绍+例题）
An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate t
2022-06-03 15:57:50
5313
1
原创 PAT-甲级 1131 Subway Map(Dfs+路径打印)
Question:In the big cities, the subway systems always look so complex to the visitors. To give you some sense, the following figure shows the map of Beijing subway. Now you are supposed to help people with your computer skills! Given the starting position
2022-05-31 19:11:33
191
原创 PAT-甲级 1126 Eulerian Path(并查集判图连通 + 欧拉图与欧拉回路判断)
Question:In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving th
2022-05-30 17:01:48
107
原创 PAT-甲级 1127 ZigZagging on a Tree（中序+后序造树，牛牛层序输出）
Question：Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple standard routine to print the numbers in level-orde
2022-05-30 17:01:04
110
原创 PAT-甲级1133 Splitting A Linked List (简单链表操作)
Question:Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all those greater than K. The order of the elements inside e
2022-05-29 21:46:19
94
原创 Hurdles of 110m（类背包问题）
描述In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Beijing Olympics is to be a festival for people all over the world as well.Liu Xiang is one of the famous Olympic athletes in China. In 2002
2022-05-29 19:46:35
134
原创 PAT-甲级 1143 Lowest Common Ancestor（ 规律BST找LCA）
QuestionThe lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.A binary search tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a
2022-05-25 11:35:42
104
原创 PAT-甲级 1145 Hashing - Average Search Time(哈希正向平方探测法的插入与查找)
QuestionThe task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer keys from the table and output the average search time (the number of comparisons made to fin
2022-05-25 10:52:11
196
原创 Hexo博客搭建和部署github(简略文字版~)
主要内容:Hexo的搭建Hexo 部署到githubHexo主题配置Hexo网页标题乱码问题Hexo页面部署成功，打开界面缺显示404hexo 缺少git组件Hexo的搭建安装Nodejsnode -v #查看node版本npm -v #查看npm版本上述步骤查看环境变量是否配置成功（下同）npm install -g cnpm --registry=http://registry.npm.taobao.org #安装淘宝的cnpm 管理器cnpm -v #查看cnpm版本cnpm ins
2022-05-23 19:49:06
357
原创 PTA-甲级1021 Deepest Root（DFS，类似树的直径）
QuestionA graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.Input Specification
2022-05-17 22:14:47
155
原创 PAT甲级-Structure of a Binary Tree（中序+后序建树）
QuestionSuppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, a binary tree can be uniquely determined.Now given a sequence of statements about the structure of the resulting tree,
2022-05-16 23:42:22
278
原创 PTA甲级1167 Cartesian Tree (笛卡尔建树 or 规律建树)
QuestionA Cartesian tree is a binary tree constructed from a sequence of distinct numbers. The tree is heap-ordered, and an inorder traversal returns the original sequence. For example, given the sequence { 8, 15, 3, 4, 1, 5, 12, 10, 18, 6 }, the min-heap
2022-05-12 11:40:44
240
原创 疫情防控（并查集 + 思维）
问题描述疫情尚未结束，严防疫情反复。为了做好疫情防控工作，国内设置了地区风险等级，对于中高风险地区的人员采取限制移动、居家隔离等手段。为了研究疫情防控对于跨地区交通运输的影响，假设现在有 N 个机场，M 条航线，每天都会新增一个防控地区，一个防控地区会导致一个机场无法正常运作，航线也自然无法正常运行，每天会有 Qi 对旅客从 Xi 机场前往 Yi 机场，请计算有多少对旅客会受到影响无法完成行程。旅客只要能直达或通过若干次中转，且乘坐的所有航线的出发和到达机场都正常运作，即视作可完成行程。输入格
2022-05-11 20:53:54
174
原创 传纸条 （dp入门）
描述小渊和小轩是好朋友也是同班同学，他们在一起总有谈不完的话题。一次素质拓展活动中，班上同学安排做成一个m行n列的矩阵，而小渊和小轩被安排在矩阵对角线的两端，因此，他们就无法直接交谈了。幸运的是，他们可以通过传纸条来进行交流。纸条要经由许多同学传到对方手里，小渊坐在矩阵的左上角，坐标(1,1)，小轩坐在矩阵的右下角，坐标(m,n)。从小渊传到小轩的纸条只可以向下或者向右传递，从小轩传给小渊的纸条只可以向上或者向左传递。在活动进行中，小渊希望给小轩传递一张纸条，同时希望小轩给他回复。班里每个同学都可以帮他
2022-05-10 20:56:36
310
原创 Tokitsukaze and Good 01-String（Dp or 贪心）
QuestionThis is the hard version of the problem. The only difference between the two versions is that the harder version asks additionally for a minimum number of subsegments.Tokitsukaze has a binary string s of length n, consisting only of zeros and one
2022-05-09 22:03:47
577
1
原创 龟兔赛跑 (入门 dp)
Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心中郁闷，发誓要报仇雪恨，于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼，终于练成了绝技，能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟，以雪前耻。 最近正值HDU举办50周年校庆，社会各大名流齐聚下沙，兔子也趁此机会向乌龟发起挑战。虽然乌龟深知获胜希望不大，不过迫于舆论压力，只能接受挑战。 比赛是设在一条笔直的道路上，长度为L米，规则很简单，谁先到达终点谁就算获
2022-05-08 16:16:06
92
原创 免费馅饼 （类似数塔，入门dp）
描述都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏，虽然在游戏中是个身手敏捷的高手，但在现实中运动神经特别迟钝，每秒种只有在移动不超过一米的范围内接住坠落的馅饼。现在给这条小径如图标上坐标：
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人