10. Code examples
11. Known applications
12. Relevant Models
13. Design Principle Pocket
Subordinate Category-Ob ...
Posted on Mon, 29 Jul 2019 19:38:56 -0700 by akrocks_extreme
The pointer piece has been very round and unclear. When reading a book, there is a function that adds nodes to the list. The code takes into account that the possible header pointer is empty and does some other processing. The code is as follows:
#include <st ...
Posted on Mon, 29 Jul 2019 18:59:05 -0700 by ktstowell
General Balanced Tree
Design a data structure that supports inserting elements, deleting elements, querying the rank of elements with value of val, querying the value with rank of rnk, and querying the precursor and backer of x
Get familiar with Splay's basic operations, which in fact work with Treap as well. To impleme ...
Posted on Mon, 29 Jul 2019 10:44:46 -0700 by jrw4
D. Nothing is Impossible HDU - 6335
It's the largest set of possibilities less than M, because there's only one correct answer, so multiply each time you get the number of options, and then compare.
#define ll long long
using namespace std;
const int maxn = 1e3;
ll b[maxn ...
Posted on Mon, 29 Jul 2019 05:34:18 -0700 by rulinus
Chapter IV Introduction 2
On PAT B1015's Virtue and Talent
There are three test points failed, showing segment errors, re-read the title and found that their arrays did not cross the boundary, are larger than the scope given by the title. Why does this problem occur?
The reason for the pr ...
Posted on Mon, 29 Jul 2019 04:21:04 -0700 by scbookz
An Attempt to Discriminate Locally Fuzzy Graphs
In order to make a deep learning project, we intend to make an automated equipment for collecting data automatically. The exposure frequency of the motion equipment and the camera is often not the same. ...
Posted on Mon, 29 Jul 2019 02:46:29 -0700 by Gubbins
Find a job at last. Come on, my little friends. Study hard and settle down. After all, the front-end profession needs continuous learning to improve and develop. Recently, I often use some methods about arrays in my work. Every time I either remember or forget some methods. Alas, today I finally have to ...
Posted on Mon, 29 Jul 2019 01:28:20 -0700 by jess3333
Tree Chain Partitioning, or Tree Partitioning for short, is used to solve the problem of maintaining path information on static trees. It is to perform some operations on the tree to make it a linear structure, so that it can be maintained with the segment tree.
Tree chains are divided into light and heavy edges. We divide the edges of the tre ...
Posted on Sun, 28 Jul 2019 06:50:59 -0700 by Smiffy
Topic link: http://poj.org/problem?id=3415
Suffix Array Paper Links: https://wenku.baidu.com/view/5b886b1ea76e58fafab00374.html
Ideas for solving problems:
Find the number of the longest common substrings not less than k.
First, we join two strings A and B to construct suffixes and height arr ...
Posted on Sun, 28 Jul 2019 06:05:34 -0700 by JoelRocks
Data Sharing between Threads
1. Why to realize data sharing among threads
1. Thread runs in parallel by default
2. What is serial operation?
2. How to realize data sharing among threads (principle of multi-threading synchronization)
1. Why can multi-threaded serial operation be realized through sy ...
Posted on Sat, 27 Jul 2019 06:51:42 -0700 by Phrank