08 2020 档案
摘要:二维数组 #include #include #include #include#include#includeusing name...
阅读全文
摘要:#include #include #include #include#include#includeusing namespac...
阅读全文
摘要:#include #include #include #include#include#includeusing namespac...
阅读全文
摘要:#include #include #include #include#include#includeusing namespac...
阅读全文
摘要:最长上升子序列 #include #include #include #includeusing namespace std;con...
阅读全文
摘要:#include #include #include #includeusing namespace std;const int ...
阅读全文
摘要:#include #include #include #includeusing namespace std;int a[1005...
阅读全文
摘要:#include #include #include #includeusing namespace std;int a[1000...
阅读全文
摘要:递归的适用范围 代替多重循环用递归解决递归形式的问题用递归将问题分解为规模更小的子问题 汉诺塔问题 #includeusing na...
阅读全文
摘要:#include#include#include#include#include#include#include#include#i...
阅读全文
摘要:#include#include#include#include#include#include#include#include#i...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:对LCA递归的理解: (代码参考的大佬 理解这个花了蛮久 唉老蠢啦) 什么是什么的父节点就是搜索到这个结点的值等于u或者v就停下来...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:注意最后一个测试点用unordered_map #include#include#include#include#include#...
阅读全文
摘要:题目大意:给两个数字D和n,第一个序列是D,后一个序列描述前一个序列的所有数字以及这个数字出现的次数,比如D出现了1次,那么第二个...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:首先涉及10位数字相加,考虑用大整数运算了,注意字符串赋值不能直接一个一个赋值,要采取拼接+s 或者赋值一个一个替换,因为要提前知...
阅读全文
摘要:这个题写了这么久我是没想到的,原本就想建立一个二维数组,然后统计数边的个数,但是复杂度达到了n的3次方,内存超限,看了解析,直接给...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:实现这个自定义遍历的思路就是直接层序遍历存入一个数组,然后对这个数组自定义排序,然后输出就行了 #include#include#...
阅读全文
摘要:欧拉图 节点度为0或2 半欧拉两个结点度为奇数,其他偶数。 同时要保证其为连通图(任意两个结点能走到) #include#incl...
阅读全文
摘要:#include#include#include#include#include#include#include#includeu...
阅读全文
摘要:#include#include#include#include#include#include#include#includeu...
阅读全文
摘要:#include#include#include#include#include#include#include#includeu...
阅读全文
摘要:#include#include#include#include#include#include#includeusing nam...
阅读全文
摘要:#include#include#include#include#include#include#include#includeu...
阅读全文
摘要:唉 自己没想出来 二刷再来看吧 #include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#includeusing nam...
阅读全文
摘要:#include#include#include#include#include#include#includeusing nam...
阅读全文
摘要:** 思路:用两个Dijkstra。一个求最短路径(如果相同求时间最短的那条),一个求最快路径(如果相同求结点数最小的那条) 数组记...
阅读全文
摘要:照相排队真站位问题 高的站中间 矮的站两边 思路:排序后中间插高的,以这个为结点,左右插入最高的 #include#include...
阅读全文
摘要:#include#include#include#include#include#include using namespace ...
阅读全文
摘要:先算出行列,然后算出层数和行数的关系,然后每一层再每个边赋值,类似于这样循环赋值找出关系就行 #include#include#...
阅读全文
摘要:思路:fac[0]=0 fac[1]=1 fac[2]=4…先存fac数组,再对这个数组进行深度优先搜索。 #include#in...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:我就不该做 难得要死 #include#include#include#include#include#include#inclu...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:dp 将复杂度降到n平方 #include#include#include#include#include#include#inc...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:递归写法 从上往下 #include#include#include#include#include#include#includ...
阅读全文
摘要:Kruskal +并查集+sort() 未AC #include#include#include#include#include#...
阅读全文
摘要:#include#include#include#include#include#include#include#include#...
阅读全文
摘要:题目大意:找出加油站要尽可能远离居民区 输出这个加油站到居民区最短距离和平均距离 #include#include#include...
阅读全文