摘要：
讲算法肯定要有相应的OJ，这里附上一道题，HDU5950 大佬博客：链接：https://www.jianshu.com/p/25eba927d9da 简单讲解下题意。F(n) = F(n-1) + 2F(n-2) + n4，且F(1) = a , F(2) = b，求F(n)%2147493647 阅读全文
摘要：
转自大佬博客https://blog.csdn.net/ACdreamers/article/details/16902023 我们首先来看一下什么是前向星. 前向星是一种特殊的边集数组,我们把边集数组中的每一条边按照起点从小到大排序,如果起点相同就按照终点从小到大排序, 并记录下以某个点为起点的所 阅读全文
摘要：
大佬博客：https://blog.csdn.net/lee18254290736/article/details/77278769 对于正常的字符串模式匹配，主串长度为m，子串为n，时间复杂度会到达O（m*n），而如果用KMP算法，复杂度将会减少线型时间O（m+n）。设主串为ptr="ababaa 阅读全文
摘要：
Polycarp is working on a new operating system called BerOS. He asks you to help with implementation of a file suggestion feature. There are n files on 阅读全文
摘要：
Polycarp has a lot of work to do. Recently he has learned a new time management rule: "if a task takes five minutes or less, do it immediately". Polyc 阅读全文
摘要：
Description Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different gende 阅读全文
摘要：
The classic Two Glass Balls brain-teaser is often posed as:“Given two identical glass spheres, you would like to determine the lowest floor in a 100-s 阅读全文
摘要：
For a string of n bits x1, x2, x3,…, xn, the adjacent bit count of the string (AdjBC(x)) is given by x1 ∗ x2 + x2 ∗ x3 + x3 ∗ x4 + . . . + xn−1 ∗ xnwh 阅读全文
摘要：
4556 The Next PermutationFor this problem, you will write a program that takes a (possibly long) string of decimal digits, andoutputs the permutation 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #define N 10000 7 using namespace std; 8 struct EDGE 9 { 10 int to;//终点 11 int cost;//边的权值 12 }; 13 vectorG[N];//G[i]中i表示出发点 ... 阅读全文