- 博客(17)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 YOLO v5学习记录
下载YOLOv5-githubYOLOv5-官网下载zip，解压：安装环境在该目录路径输入cmd：或者在pycharm打开该目录，进入terminal即可输入命令：conda create -n yolov5-master python=3.8*yolo要求python>=3.8、yolov5-master是环境的名字*conda命令合集：conda --version：查看Conda版本conda -h：查看帮助文件conda create -n env_nam
2021-11-21 21:04:13
3300
原创 2021年中国高校计算机大赛-团队程序设计天梯赛(GPLT)L2四道题
题目记不清了，但大致题意还有印象L2-1NNN个传送带，一个堆栈，堆栈大小为SmaxSmaxSmax，传送带=>=>=>队列，传送带不停的往堆栈里面推东西，或是用夹子从堆栈里面取东西，STLSTLSTL模拟题，注意一个细节：当堆栈满时再往堆栈里推东西时要先把堆栈顶层的东西拿走，但是当该传送带上什么都没有的时候(即没有东西推入堆栈)，就不用取出堆栈顶的东西了。#include <bits/stdc++.h>#define int long long#define all
2021-04-24 23:11:53
965
原创 2020ICPC济南站4道签到题
M Cook Pancakes!签到题，一共有N∗2N*2N∗2个面，一次烤KKK个面，一次最多烤NNN个面(因为最多NNN个烧饼一块烤)，向上取整。#include <bits/stdc++.h>using namespace std; const int N = 1e5 + 5;int n, m, k;int a[N], b[N], f[N]; void work() { cin >> n >> k; if (k > n) {
2021-04-14 20:04:47
295
原创 团体程序设计天梯赛-练习集 L3-010 是否完全二叉搜索树 (30分)建树层序遍历 两种方法判断
L3-010 是否完全二叉搜索树 (30分)将一系列给定数字顺序插入一个初始为空的二叉搜索树（定义为左子树键值大，右子树键值小），你需要判断最后的树是否一棵完全二叉树，并且给出其层序遍历的结果。输入格式：输入第一行给出一个不超过20的正整数N；第二行给出N个互不相同的正整数，其间以空格分隔。输出格式：将输入的N个正整数顺序插入一个初始为空的二叉搜索树。在第一行中输出结果树的层序遍历结果，数字间以1个空格分隔，行的首尾不得有多余空格。第二行输出YES，如果该树是完全二叉树；否则输出NO。输入样例1
2020-11-26 16:54:10
216
1
转载 PAT (Advanced Level) Practice 1044 Shopping in Mars (25分)求区间和
1044 Shopping in Mars (25分)Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). When making the payment, the chain can be cut at any position for only once and some of th
2020-11-14 17:50:57
88
原创 PAT (Advanced Level) Practice 1043 Is It a Binary Search Tree (25分)建树 先序后序遍历
1043 Is It a Binary Search Tree (25分)A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s key.The right subtree of a node cont
2020-11-14 17:47:06
322
原创 PAT (Advanced Level) Practice 1099 Build A Binary Search Tree (30分)二叉搜索树性质 中序遍历 层序遍历
1099 Build A Binary Search Tree (30分)A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s key.The right subtree of a node cont
2020-11-13 17:55:56
93
转载 c++运算符的重载
(1)只能使用成员函数重载的运算符有：=、()、[]、->、new、delete。(2)单目运算符最好重载为成员函数。(3) 对于复合的赋值运算符如+=、-=、*=、/=、&=、!=、~=、%=、>>=、<<=建议重载为成员函数。(4) 对于其它运算符，建议重载为友元函数。运算符重载的方法是定义一个重载运算符的函数，在需要执行被重载的运算符时，系统就自动调用该函数，以实现相应的运算。也就是说，运算符重载是通过定义函数实现的。运算符重载实质上是函数的重载。重载运算
2020-11-13 16:41:14
639
原创 PAT (Advanced Level) Practice 1115 Counting Nodes in a BST (30分)建树+bfs
1115 Counting Nodes in a BST (30分)A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than or equal to the node’s key.The right subtree of a
2020-11-09 18:31:34
85
原创 PAT (Advanced Level) Practice 1068 Find More Coins (30分)dfs+剪枝
1068 Find More Coins (30分)1068 Find More Coins （30 分）Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However,
2020-11-08 20:57:42
93
原创 PAT (Advanced Level) Practice 1057 Stack (30分)堆模拟
Practice 1057 Stack (30分)Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the top position) and Pop (deleting the top element).
2020-11-07 21:45:42
127
原创 PAT (Advanced Level) Practice 1045 Favorite Color Stripe (30分)最长不下降子序列
Favorite Color Stripe (30分)Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted pieces and sewing the remaining parts together to form her favori
2020-11-05 09:21:28
70
原创 根据前或后遍历和中序遍历建立二叉树
根据前或后遍历和中序遍历建立二叉树不是最优解法，但只是原创的，记录一下省的忘#include <bits/stdc++.h>#include <limits.h>#include <math.h>#include <memory.h>#include <stdio.h>#include <algorithm>#include <iostream>#include <map>#include
2020-11-04 22:01:03
102
原创 PAT (Advanced Level) Practice 1014 Waiting in Line (30分)vector模拟队列
1014 Waiting in Line (30分)传送门题意：NNN 个银行窗口，每个银行窗口的排队区可以等待MMM个人，一共有KKK个人按照输入顺序来到银行准备排队办理业务，输入的KKK个数为每个人自己办理业务需要的时间，排队的规则是先找排队人最少的窗口，如果有多个就找编号最小的窗口，窗口编号为1∼N1 \sim N1∼N，接着有QQQ个询问，询问每个人办理完业务的时间，时间从早上八点开始，如果这个人在下午五点之前还没有排上队就不能办理它的业务了。题解：每个窗口就是一个队列，直接模拟，先把N∗
2020-10-26 22:09:15
87
原创 蓝桥杯2018初赛AB组决赛部分题目(持续更新中...)
蓝桥杯2018初赛AB组决赛部分题目(持续更新中…)按照New Online Judge的题目先后顺序下次一定边敲边写博客，敲完再回去找太慢了文章目录蓝桥杯2018初赛AB组决赛部分题目(持续更新中...)[蓝桥杯2018初赛]分数题解：[蓝桥杯2018初赛]星期一题解：[蓝桥杯2018初赛]乘积尾零题解：[蓝桥杯2018初赛]第几个幸运数题解：[蓝桥杯2018初赛]航班时间题解：[蓝桥杯2018初赛]分数1/1 + 1/2 + 1/4 + 1/8 + 1/16 + …每项是前一项的一半，如果一
2020-10-16 08:41:53
377
原创 PTA天梯赛-练习集 L1-064 估值一亿的AI核心代码 (20分)
PTA L1-064 估值一亿的AI核心代码 (20分)纪念第一次用正则解题。题意：字符串处理，其中有几个操作：空格消去：去掉首尾空格，去掉标点符号前空格，行间多余空格变为一个。除了大写III，其余字母全变为小写(无论大写III是单独还是在单词内)。问号变为感叹号。把两边被空格或者标点分开的词组can youcan\ youcan you 和could youcould\ youcould you分别变为I canI\ canI c
2020-10-13 20:09:29
441
原创 【2020年杭电暑假第五场】6822 Paperfolding 数学公式推导+逆元
【2020年杭电暑假第五场】6822 Paperfolding补题题目链接There is a piece of paper in rectangular shape with sufficient length and width (lay flat on the table). Execute an operation instruction according to a string of length n from left to right that only contains 4 diff
2020-08-23 17:46:31
161
1
MinGW.zip1
2020-05-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人